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

339

Tags

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