Partitioning multi-edge graphs

DOI10.1007/BF01931660zbMath0696.68088OpenAlexW2009053036MaRDI QIDQ911315

Ravi Varadarajan

Publication date: 1990

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01931660

zbMATH Keywords

clusterbroadcasting communication networksdepth-first search algorithmmulti-edge graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of software (68N99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Markov Decision Processes with Sample Path Constraints: The Communicating Case
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Partitioning multi-edge graphs