A linear algorithm for the all-bidirectional-edges problem on planar graphs
Ramprasad, P. B. ; Pandu Rangan, C.
- Link zu diesem Datensatz
- https://d-nb.info/1322931356
- Titel
- A linear algorithm for the all-bidirectional-edges problem on planar graphs
- Art des Inhalts
- Teil eines Werks
- Verfassangaben
- by P. B. Ramprasad, C. Pandu Rangan
- Autor(en)
-
- Ramprasad, P. B.
- Pandu Rangan, C.
- Organisation(en)
-
- SpringerLink (Online service)
- Zeitliche Einordnung
- Erscheinungsdatum: 1993
- Umfang/Format
- 1 Online-Ressource.
- DOI
- 10.1007/BF01190896
- Online
- https://doi.org/10.1007/BF01190896
- Sprache
- eng
- Schlagwörter
-
- (lcsh)Algorithms.
- (lcsh)Computer science.
- (lcsh)Computer science—Mathematics.
- (lcsh)Computer engineering.
- (lcsh)Computer networks .
- (lcsh)Data structures (Computer science).
- (lcsh)Information theory.
- Design and Analysis of Algorithms.
- Theory of Computation.
- Mathematics of Computing.
- Algorithms.
- Computer Engineering and Networks.
- Data Structures and Information Theory.
- Frühere/spätere Titel
-
- Enthalten in: Algorithmica
- Enthalten in: Algorithmica
- Enthalten in: Algorithmica
- Stand
- 09.03.2024 10:38
- Im Katalog seit
- 07.03.2026