Routing Problems on the Mesh of Buses

DOI10.1006/JAGM.1996.0030zbMATH Open0845.68047OpenAlexW2067135139MaRDI QIDQ4881407FDOQ4881407

Authors: C. Iwamoto, Kazuo Iwama 

Publication date: 16 September 1996

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1996.0030

Recommendations

• scientific article; zbMATH DE number 1555967
• Parallel Complexity of the Connected Subgraph Problem
• Approximating unweighted connectivity problems in parallel

zbMATH Keywords

NP-complete\(\alpha\)-connectivity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (2)

• A faster parallel algorithm for \(k\)-connectivity
• Title not available (Why is that?)

This page was built for publication: Routing Problems on the Mesh of Buses

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