|
|||||
|
|
Sparse graph certificates for mixed connectivity |
|
| Authors: | O Fülöp |
| Institution: | Institute of Mathematics, Technical University of Budapest, Egry József u. 1., H-1521 Budapest, Hungary |
| Abstract: | We give a short proof for the Mixed Connectivity Certificate Theorem of Even, Itkis and Rajsbaum and provide an upper bound on the edge number of a certificate of local T-mixed connectivity up to k. |
| Keywords: | Mixed cut Legal ordering Greedy forest Mixed connectivity certificate |
| 本文献已被 ScienceDirect 等数据库收录！ | |