Algorithms and Data Structures
From MaRDI portal
Publication:5900763
DOI10.1007/b11837zbMath1206.68143MaRDI QIDQ5900763
Publication date: 20 April 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Improved edge-coloring with three colors, A note on using the resistance-distance matrix to solve Hamiltonian cycle problem, Open problems around exact algorithms, Solving connected dominating set faster than \(2^n\), Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem, Approximating the maximum clique minor and some subgraph homeomorphism problems, Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem, Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples
