1. Présentation
 

Rechercher

ALGCO

 Algorithmes, Graphes et Combinatoire

Consultez vos droits d'auteur

 
     
Consulter la politique des éditeurs également sur

Nombre de Fichiers déposés

223

Nombre de Notices déposées

350

Cartographie des collaborations

Tags

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

Site web de l'équipe ALGCO