The Linkage of a Graph

DOI10.1137/S0097539793255709zbMATH Open0851.68035DBLPjournals/siamcomp/KirousisT96WikidataQ57259023 ScholiaQ57259023MaRDI QIDQ4887020FDOQ4887020

Authors: L. M. Kirousis, Dimitrios M. Thilikos 

Publication date: 15 October 1996

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Recommendations

• Graph minors. XXI. graphs with unique linkages
• DAG-width and circumference of digraphs
• The directed 2-linkage problem with length constraints
• Parameterized and Exact Computation
• Disjoint paths in decomposable digraphs

zbMATH Keywords

constraint satisfaction problemsbacktrack-free searchlinkage of a graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Cited In (11)

• Fugitive-search games on graphs and related parameters
• The equivalence chain of a graph
• Treewidth for graphs with small chordality
• Online promise problems with online width metrics
• Graph-links
• Linkages in Polytope Graphs
• Fugitive-search games on graphs and related parameters
• On the monotonicity of games generated by symmetric submodular functions.
• The Strong Linkage Principle
• Why is maximum clique often easy in practice?
• Edge degeneracy: algorithmic and structural results

This page was built for publication: The Linkage of a Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887020)