Publication:4321476

From MaRDI portal

Revision as of 21:46, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

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

Jump to:navigation, search

zbMath0814.68073MaRDI QIDQ4321476

Qian-Ping Gu, Shietung Peng

Publication date: 12 June 1995

zbMATH Keywords

interconnection networks; star graphs; disjoint paths; fault tolerance computations

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

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

68W15: Distributed algorithms

Related Items

Unnamed Item, Node-to-set disjoint paths problem in star graphs, One-to-many node-disjoint paths in \((n,k)\)-star graphs

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