Algorithmes, Graphes et Combinatoire

Consult your copyright


Consulter la politique des éditeurs également sur

Number of Files


Nomber of Notices


Collaborations’ map


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