Skip to Main content Skip to Navigation
 

Search

ALGCO

 Algorithmes, Graphes et Combinatoire

Consult your copyright

 
     

Consulter la politique des éditeurs également sur

Number of Files

338

Nomber of Notices

335

Collaborations’ map

Tags

Boolean mapping Activity Hyperplane arrangement Domination Treewidth Parameterized algorithms Graph minors Graph drawing Analysis of algorithms Graph degeneracy Graph Graph Minors Sparse graphs Bidimensionality Pattern avoidance Exponential Time Hypothesis Tournaments Interval graphs Approximation algorithm Graph theory Maximum average degree Irrelevant vertex technique 2-partition Basis Tournament Branchwidth Erdős–Pósa property Hardness of approximation Graphs 2-distance coloring Traffic grooming Optical networks Kernelization Graph colouring Branch-width Graph algorithms Planar graph ALGORITHME Homomorphism Polynomial kernel Protrusion decomposition Memory optimization Well-quasi-ordering Algorithm Permutation graphs Phylogenetic networks Bijection Combinatorics Square coloring MCS Asymptotic enumeration Graph modification problems Oriented coloring Hitting minors Complexity Minimal triangulation Single-exponential algorithm Fixed-parameter tractability Graph coloring Cutwidth NP-completeness Oriented graph Analyse prédicative Combinatoire Acyclic coloring Minimum degree Edge coloring Algorithms Topological minors Dynamic programming Approximation algorithms Coloration Non-crossing partitions Clique-width Tutte polynomial GRAPHS Planar graphs Linkages Parameterized complexity Approximation Packings in graphs Graphs on surfaces Matroid Linear kernels Discharging procedure First-order logic Graph decomposition Obstructions Chordal graphs FPT algorithm Duality Computational complexity Oriented matroid Robust optimization Complexité paramétrée Algorithmique des graphes LexBFS Girth Avoidability Immersions