graphs bookmarks

ABACUS is a software system which provides a framework for the implementation of branch-and-bound algorithms using linear programming relaxations that can be complemented with the dynamic generation of cutting planes or columns (branch-and-cut, branch-and-price, branch-and-cut-and-price).

PAGES PERSONNELLES - HOME PAGES

Ramsey Numbers, Regular Graphs of Given Degree and Girth, Large Regular Graphs of Given Degree and Diameter, Graphs Drawings, Combinatorial Geometry, Asymmetric Covering Codes,

EXERCICES - EXERCISES

ALGORITHMES

PROBLÈMES - PROBLEMS

DEMOS

L'exemple est identique à celui des Graphes probabilistes Les données sont celles de l'activité 12 p. 278 du livre. Tous les calculs peuvent être effectués hors connexion, les calculs sont effectués par le navigateur qui interprète le programme écrit en javascript et contenu dans la page.

EXEMPLES - EXAMPLES

DOT and DOTTY are graph layout products from AT&T Bell Labs. DOT is a Unix filter that takes a DOT language file specifying the objects in a directed graph and output a optimal (in some sense) layout of the objects in one of a number of formats including Postscript and Maker Interchange Format (MIF).

DICTIONNAIRES GLOSSAIRES - DICTIONARIES

LOGICIELS - SOFTWARES

is a system dedicated to the visualization of huge graphs. It manages graphs with a number of elements(node and edges) up to 500.000 on a personal computer(PIII 600, with 256mo).

PROGRAMMES

OUTILS - TOOLS

This toolbox contains Matlab code for several graph and mesh partitioning methods, including geometric, spectral, geometric spectral, and coordinate bisection. It also has routines to generate recursive multiway partitions, vertex separators, and nested dissection orderings; and it has some sample meshes and mesh generators.

is a family of programs for partitioning unstructured graphs and hypergraphs and computing fill-reducing orderings of sparse matrices. The underlying algorithms used by METIS are based on the state-of-the-art multilevel paradigm that has been shown to produce high quality results and scale to very large problems.

This is a perl module for reading treefiles in the phylip format and generating PNG files with a graphical representation of the tree. It requires the GD.pm perl module for graphics drawing by Lincoln Stein

Given two terms, wnconnect is a program that finds and reports all possible connections between them in WordNet, a popular and freely-available synset (synonym set) network with semantic relations. WordNet is from Princeton University, see http://www.cogsci.princeton.edu/~wn/.

Graph Realization is the problem of constructing a tree from a set of its edge-labeled paths. More formally, Given subsets P1,..Pn of {0,..,m-1}, find a tree T=(V,E) with E={0,..,m-1} such that every Pi is a path in T, or determine that no such tree exists.
Graph Realization was first defined by Tutte [2]. Several polynomial algorithms for the problem were introduced in [1,3,4]. Graph Realization recently came back to awareness in computational molecular biology, in problems related to haplotype inference under the perfect phylogeny model [5].

SOURCES

JAVA

PERL

Mkfunctmap is a Perl script that produces a graphical map of functions and function calls in a C program that was written by James Hoagland. Only those calls made to functions within the

TESTS COMPÉTITIFS - BENCHMARKS

Maximum Independent Set (MIS) and Minimum Vertex Cover (MVC), Maximum Clique and Vertex Coloring, Forced Satisfiable CSP and SAT Benchmarks of Model RB, Pseudo-Boolean (0-1 Integer Programming) Benchmarks

THÈSES - THESIS

Dans cette thèse nous nous intéressons à l'existence de chemins, cycles et arbres dans les tournois et dans le dernier chapitre, nous considérons le côté algorithmique du problème.

LIVRES - BOOKS

SUJETS - SUBJECTS

DOCUMENTS - PAPERS

Dans cet article, on examine d'abord le concept de relation d'appartenance et sa signification théorique. Ensuite, on définit le concept de place et celui de réseau de places, dont on analyse les propriétés algébriques.

RÉSUMÉS - ABSTRACTS

JOURNAUX - LETTERS

COURS - COURSES

TUTORIELS - TUTORIALS

MANUELS - MANUALS

AGD offers a broad range of existing algorithms for two-dimensional graph drawing and tools for implementing new algorithms. It is a product of a cooperation of groups in Halle, Köln, Saarbrücken, and Wien, and originated from the DFG-funded project "Design, Analysis, Implementation, and Evaluation of Graph Drawing Algorithms" in 1995-2000. Currently, AGD is further developed by the groups in Köln and Wien.

The Boost web site provides free peer-reviewed portable C++ source libraries. The emphasis is on libraries which work well with the C++ Standard Library. One goal is to establish "existing practice" and provide reference implementations so that the Boost libraries are suitable for eventual standardization. Some of the libraries have already been proposed for inclusion in the C++ Standards Committee's upcoming C++ Standard Library Technical Report.

CONFÉRENCES - MEETINGS

ABONNEMENTS - MAILING LISTS

ist is for informal, collegial discussion of the latest research advances, and especially newsworthy cutting-edge or breakthrough developments, in the hardest problems in computation and mathematics. Topics are the famous and most difficult unsolved theoretical problems currently facing computer scientists and theoretical mathematicians.

LIENS - LINKS

Ce site a pour but de proposer quelques URL concernant le thème trés large de la Recherche Opérationnelle, l'optimisation combinatoire et quelques disciplines associées.

Actualités

Advertising : If you see a reference in one of the files that is not linked, and you know of a link address to the appropriate document, please send me mail, and I will include the link in the document. Thanks very much in advance.
Avertissement : Le classement par catégories est approximatif. Certains liens se retrouvent dans des rubriques différentes et sur plusieurs pages. Les commentaires sont généralement des courts extraits des pages référencées. Il est possible que certains liens nécessitent une mise à jour.
Tous commentaires ou remarques sont les bienvenus, vous pouvez les adresser à :

Les mises à jour demandées sont réalisées dès que possible et, sauf si c'est nécessaire, aucun message de réponse n'est expédié. Merci de m'écrire.

Copyright © 1999-2006 Jean-Paul Davalan - Reproduction interdite.

Graphes - Graphs

GROUPES - GROUPS

PAGES WEB