Rechercher

ALGCO

 Algorithmes, Graphes et Combinatoire

Consultez vos droits d'auteur

 
     

Consulter la politique des éditeurs également sur

Nombre de Fichiers déposés

234

Nombre de Notices déposées

360

Cartographie des collaborations

Tags

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