Algorithmes, Graphes et Combinatoire

Consult your copyright


Consulter la politique des éditeurs également sur

Number of Files


Nomber of Notices


Collaborations’ map


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