Nombre de Fichiers déposés

204

ALGCO

 Algorithmes, Graphes et Combinatoire

Consultez vos droits d'auteur

 
     

Consulter la politiques des éditeurs également sur

Nombre de Notices déposées

317

Tags

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