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

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