Nombre de Fichiers déposés

208

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

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