Algorithmes, Graphes et Combinatoire

Consult your copyright


Consulter la politique des éditeurs également sur

Number of Files


Nomber of Notices


Collaborations’ map


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