Fast Edge-Searching and Related Problems
From MaRDI portal
Publication:3066461
DOI10.1007/978-3-642-17461-2_19zbMATH Open1310.91048OpenAlexW1589799646MaRDI QIDQ3066461
Publication date: 10 January 2011
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17461-2_19
Search theory (90B40) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Edge Bipartization Faster Than 2^k ⋮ Fast-mixed searching and related problems on graphs ⋮ Deterministic Edge Connectivity in Near-Linear Time ⋮ Efficient edge-skeleton computation for polytopes defined by oracles
This page was built for publication: Fast Edge-Searching and Related Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066461)
