Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A stabilizing algorithm for finding biconnected components

From MaRDI portal
Publication:701154
Jump to:navigation, search

DOI10.1006/JPDC.2001.1833zbMath1004.68020OpenAlexW1965251111MaRDI QIDQ701154

Mehmet Hakan Karaata

Publication date: 16 October 2002

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/edb42f2afb385f6a83f599d33544c10b91d6d469


zbMATH Keywords

self-stabilizing algorithm


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Distributed systems (68M14)


Related Items (4)

SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS ⋮ An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity ⋮ A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets ⋮ An optimal self-stabilizing strarvation-free alternator







This page was built for publication: A stabilizing algorithm for finding biconnected components

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:701154&oldid=12614785"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 09:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki