Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Optimal parallel algorithm for finding \(st\)-ambitus of a planar biconnected graph - MaRDI portal

Optimal parallel algorithm for finding \(st\)-ambitus of a planar biconnected graph

From MaRDI portal

Publication:1908264

Jump to:navigation, search

zbMath0840.68056MaRDI QIDQ1908264

Publication date: 27 June 1996

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

graph algorithms bridges biconnected graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (1)

Optimal parallel algorithms for path problems on planar graphs

This page was built for publication: Optimal parallel algorithm for finding \(st\)-ambitus of a planar biconnected graph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1908264&oldid=14325092"