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

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