Search

ALGCO

 Algorithmes, Graphes et Combinatoire

Consult your copyright

 
     

Consulter la politique des éditeurs également sur

Number of Files

261

Nomber of Notices

350

Collaborations’ map

Tags

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