Algorithmes, Graphes et Combinatoire

Consult your copyright


Consulter la politique des éditeurs également sur

Number of Files


Nomber of Notices


Collaborations’ map


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