Algorithmes, Graphes et Combinatoire

Consult your copyright


Consulter la politique des éditeurs également sur

Number of Files


Nomber of Notices


Collaborations’ map


Branchwidth Approximation Graph colouring Optical networks Domination Connectivity Degree-constrained subgraph Hyperplane arrangement Directed graph Analysis of algorithms Graphs on surfaces Bidimensionality Parameterized algorithms Computational complexity Complexité paramétrée Coverings in graphs Butterfly Graph Branch-width Chordal graphs Discharging Graph Minors Combinatorics GRAPHS Algorithms Discharging method Clause implication Graph minors Breadth First Search Edge coloring Maximum average degree Algorithm ALGORITHME Treewidth Circuit design Coloring Complexity Discharging procedure Dynamic programming Clique tree Tutte polynomial Matroid Memory optimization Graph coloring Fixed-parameter tractability Interval graphs Graph algorithms Algorithmique des graphes MCS Packings in graphs Traffic grooming Non-crossing partitions Activity LexBFS Minimal triangulation Graph decomposition Hardness of approximation Degree sequence Common Intervals Pattern avoidance Planar graph Analyse prédicative Densité des idées Graph theory Kernelization Oriented matroid Protrusion decomposition Linkages Girth Clique separator decomposition Approximation algorithms 2-distance coloring Approximation algorithm Planar graphs Digraph homomorphism Duality Carving-width Distance constrained colouring Bijection Oriented coloring Erdős–Pósa property Well-quasi-ordering Tournament Phylogenetic networks Sparse graphs Clique-width Basis Boolean mapping Parameterized complexity Coloration Distance-hereditary graphs Linear kernels Combinatoire Graphs FPT algorithm Avoidability Cutwidth Square coloring NP-completeness Permutation graphs