1 option
Steiner type packing problems in digraphs Yuefang Sun
Springer Nature - Springer Mathematics and Statistics (R0) eBooks 2026 English International Available online
View online- Format:
- Book
- Author/Creator:
- Sun, Yuefang, author.
- Series:
- SpringerBriefs in mathematics
- SpringerBriefs in mathematics 2191-8201
- Language:
- English
- Subjects (All):
- Directed graphs.
- Graph theory.
- Physical Description:
- 1 online resource
- Place of Publication:
- Singapore Springer [2026]
- Summary:
- "Graph packing problem is one of the central problems in graph theory and combinatorial optimization. The famous Steiner tree packing problem in undirected graphs has become an well-established area. It is natural to extend this problem to digraphs. The corresponding problems in digraphs are called directed Steiner type packing problems which are highly related to some important problems in graph theory. In this book, the author tried to collect known results on several Steiner type packing problems in digraphs, including directed Steiner tree packing problem, directed Steiner path packing problem, strong subgraph packing problem, strong arc decomposition problem, directed Steiner cycle packing problem. This book also contains some conjectures and open problems for further study. The author hopes this book can motivate more young researchers and graduate students to do further study in this subject, and promote the interdisciplinary research of graph theory, combinatorial optimization, theoretical computer science and communication networks"-- Springer Nature Link
- Contents:
- Directed Steiner tree packing problem
- Directed Steiner path packing problem
- Strong subgraph packing problem
- Strong arc decomposition problem
- Directed Steiner cycle packing problem
- Notes:
- Includes bibliographical references and index
- Online resource; title from PDF title page (Springer Nature Link, viewed June 3, 2026)
- Other Format:
- Print version Sun, Yuefang Steiner type packing problems in digraphs
- ISBN:
- 9789819587438
- 9819587433
- OCLC:
- 1593335156
- Access Restriction:
- Restricted for use by site license
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.