Algorithmes, Graphes et Combinatoire

Consult your copyright


Consulter la politique des éditeurs également sur

Number of Files


Nomber of Notices


Collaborations’ map


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