Nombre de Fichiers déposés

217

ALGCO

 Algorithmes, Graphes et Combinatoire

Consultez vos droits d'auteur

 
     

Consulter la politique des éditeurs également sur

Nombre de Notices déposées

341

Tags

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