Algorithmes, Graphes et Combinatoire

Consult your copyright


Consulter la politique des éditeurs également sur

Number of Files


Nomber of Notices


Collaborations’ map


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