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
Switching Distance Between Graphs with the Same Degrees - MaRDI portal

Switching Distance Between Graphs with the Same Degrees

From MaRDI portal

Publication:4699158

Jump to:navigation, search

DOI10.1137/S0895480197331156zbMath0931.05029MaRDI QIDQ4699158

Todd G. Will

Publication date: 23 November 1999

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

NP-complete switching degree sequence symmetric circuit partition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (6)

Split graphs ⋮ Unnamed Item ⋮ On the longest flip sequence to untangle segments in the plane ⋮ Complexity results on untangling red-blue matchings ⋮ Approximating Shortest Connected Graph Transformation for Trees ⋮ The Perfect Matching Reconfiguration Problem

This page was built for publication: Switching Distance Between Graphs with the Same Degrees

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