Nombre de Fichiers déposés

216

ALGCO

 Algorithmes, Graphes et Combinatoire

Consultez vos droits d'auteur

 
     

Consulter la politiques des éditeurs également sur

Nombre de Notices déposées

335

Tags

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