New results on routing via matchings on graphs

From MaRDI portal

Revision as of 05:18, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1679957

Jump to:navigation, search

DOI10.1007/978-3-662-55751-8_7zbMath1496.68262arXiv1706.09355OpenAlexW3097115477MaRDI QIDQ1679957

Indranil Banerjee, D. S. Richards

Publication date: 22 November 2017

Full work available at URL: https://arxiv.org/abs/1706.09355

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant ⋮ Unnamed Item

This page was built for publication: New results on routing via matchings on graphs

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