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
Representation of Edmonds' algorithm for finding optimum graph branching on associative parallel processors - MaRDI portal

Representation of Edmonds' algorithm for finding optimum graph branching on associative parallel processors

From MaRDI portal

Publication:1403184

Jump to:navigation, search

DOI10.1023/A:1010918704202zbMath1038.68088OpenAlexW1570102724MaRDI QIDQ1403184

A. Sh. Nepomnyashchaya

Publication date: 1 September 2003

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1010918704202

Mathematics Subject Classification ID

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

This page was built for publication: Representation of Edmonds' algorithm for finding optimum graph branching on associative parallel processors

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