ملخص
We define a two-terminal directed acyclic graph (st-dag) characterized by a special structure of its mincuts and call it a nested graph. It is proved that every nested graph is series-parallel as well. We show that an st-dag of order n has exactly n - 1 mincuts if and only if it is nested.
اللغة الأصلية | الإنجليزيّة |
---|---|
الصفحات (من إلى) | 93-99 |
عدد الصفحات | 7 |
دورية | Electronic Notes in Discrete Mathematics |
مستوى الصوت | 24 |
المعرِّفات الرقمية للأشياء | |
حالة النشر | نُشِر - 15 يوليو 2006 |
منشور خارجيًا | نعم |