Algorithmes, Graphes et Combinatoire

Consult your copyright


Consulter la politique des éditeurs également sur

Number of Files


Nomber of Notices


Collaborations’ map


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