Rechercher

ALGCO

 Algorithmes, Graphes et Combinatoire

Consultez vos droits d'auteur

 
     

Consulter la politique des éditeurs également sur

Nombre de Fichiers déposés

226

Nombre de Notices déposées

349

Cartographie des collaborations

Tags

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