Algorithms and Data Structures

From MaRDI portal

Revision as of 01:23, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5900763

Jump to:navigation, search

DOI10.1007/b11837zbMath1206.68143MaRDI QIDQ5900763

David Eppstein

Publication date: 20 April 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

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

This page was built for publication: Algorithms and Data Structures

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5900763&oldid=16938891"