Nombre de Fichiers déposés

208

ALGCO

 Algorithmes, Graphes et Combinatoire

Consultez vos droits d'auteur

 
     

Consulter la politiques des éditeurs également sur

Nombre de Notices déposées

322

Tags

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