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 edge ranking of complete bipartite graphs in polynomial time - MaRDI portal

Optimal edge ranking of complete bipartite graphs in polynomial time

From MaRDI portal

Publication:5492694

Jump to:navigation, search

DOI10.7151/DMGT.1309zbMath1104.05065OpenAlexW1966106391MaRDI QIDQ5492694

Ruo-Wei Hung

Publication date: 16 October 2006

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

colouring NP-complete edge ranking

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Optimal edge ranking of complete bipartite graphs in polynomial time

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