Rechercher

ALGCO

 Algorithmes, Graphes et Combinatoire

Consultez vos droits d'auteur

 
     

Consulter la politique des éditeurs également sur

Nombre de Fichiers déposés

224

Nombre de Notices déposées

346

Cartographie des collaborations

Tags

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