A streaming algorithm for the undirected longest path problem

DOI10.4230/LIPICS.ESA.2016.56MaRDI QIDQ4606328zbMATH OpenOpenAlexFDO

Authors Lasse Kliemann, Christian Schielke, Anand Srivastav

Publication date 2 March 2018

Full work available at URL http://dx.doi.org/10.4230/LIPIcs.ESA.2016.56

zbMATH Keywords

combinatorial optimizationgraph algorithmsstreaming algorithmsundirected longest path problem

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Graph algorithms (graph-theoretic aspects) (05C85) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Algorithms for long paths in graphs
• On Estimating Path Aggregates over Streaming Graphs
• scientific article; zbMATH DE number 3974318
• Automata, Languages and Programming
• On approximating the longest path in a graph

Cited in

(1)

• Constructing long paths in graph streams

This page was built for publication: A streaming algorithm for the undirected longest path problem

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