Nombre de Fichiers déposés

189

ALGCO

 Algorithmes, Graphes et Combinatoire

Consultez vos droits d'auteur

 
     

Consulter la politiques des éditeurs également sur

Nombre de Notices déposées

322

Tags

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