Testing isomorphism of outerplanar graphs in parallel
- ,
- Krzysztof Diks,
- Tomasz Radzik
- University of Warsaw
Scholary Output:
Chapter in Book/Report/Conference proceeding
Conference contribution
Related Event
Title
13th Symposium on Mathematical Foundations of Computer Science, MFCS 1988
Event type
ConferenceDate
08/29/1988 - 09/02/1988Location
CarlsbadSerbia
Abstract
It is shown that isomorphism of two outerplanar graphs with n vertices can be verified on CRCW PRAM in time O(log n) using n processors. This improves the previous results of Ruzzo [R] and Miller & Reif [MR] concerning parallel isomorphism of trees.
Publication Information
Output type
Scholary Output:
Chapter in Book/Report/Conference proceeding
Conference contribution
Original language
English (US)Pages from-to (Number of pages)
Pages 220-230 (11 pages)Publication milestones
- Published - 1988
Publication status
Published - 1988
Publisher
Springer VerlagPublication series
- Publication series name: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print): 0302-9743
ISSN (Electronic): 1611-3349
Volume: 324 LNCS
ISBN (Print)
9783540501107Publication IDs
- Scopus: 85032868769
Host publication title
Mathematical Foundations of Computer Science 1988 - Proceedings of the 13th SymposiumHost publication editors
- Michal P. Chytil
- Vaclav Koubek
- Ladislav Janiga
Publication metrics
Metrics
Fractional count
1
Fractional count
0.33
Fractional count
2
Fractional count
0.67
Fractional count
1
Fractional count
1
PlumX, opens in new tab
Citation count
6
