Heuristic and exact algorithms for the spanning tree detection problem

DOI10.1016/S0305-0548(03)00215-6zbMath1073.90058OpenAlexW2006220593MaRDI QIDQ1885939

Seiji Kataoka, Takeo Yamada, Kohtaro Watanabe

Publication date: 12 November 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00215-6

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Exact arborescences, matchings and cycles
• Lower bounds for combinatorial problems on graphs
• The complexity of restricted spanning tree problems
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Heuristic and exact algorithms for the spanning tree detection problem