Node-to-set disjoint paths problem in rotator graphs

DOI10.1007/3-540-44464-5_10MaRDI QIDQ2766531zbMATH OpenFDO

Authors Keiichi Kaneko, Yasuto Suzuki

Publication date 28 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44464-5_10

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Node-to-set disjoint paths problem in star graphs
• One-to-many node-disjoint paths in \((n,k)\)-star graphs
• On the disjoint paths problem
• scientific article; zbMATH DE number 1161303
• scientific article; zbMATH DE number 3946171

Cited in

(2)

• Conditional connectivity of recursive interconnection networks respect to embedding restriction
• Fault tolerance in bubble-sort graph networks

This page was built for publication: Node-to-set disjoint paths problem in rotator graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2766531)