Steiner Type Packing Problems in Digraphs

By: Yuefang Sun

Write A Review

eText | 27 May 2026

At a Glance

Format
ePUB

eText

$84.99

or 4 interest-free payments of $21.25 with

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

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.