Algorithmes, Graphes et Combinatoire

Consult your copyright


Consulter la politique des éditeurs également sur

Number of Files


Nomber of Notices


Collaborations’ map


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