Peng Cheng

Available identifiers

Publication	Date of Publication	Type
A proof of unimodality on the numbers of connected spanning subgraphs in an \(n\)-vertex graph with at least \(\left\lceil (3-2\sqrt 2) n^2 + n - \frac {7-2\sqrt 2}{2 \sqrt 2}\right\rceil\) edges	2010-05-05	Paper
https://portal.mardi4nfdi.de/entity/Q4937186	2000-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q4937201	2000-02-03	Paper
A lower bound of the expected maximum number of edge-disjoint \(s\)--\(t\) paths on probabilistic graphs	1995-08-10	Paper
A LOWER BOUND OF THE EXPECTED MAXIMUM NUMBER OF VERTEX-DISJOINT s-t PATHS ON PROBABILISTIC GRAPHS	1995-08-01	Paper
On the equivalence in complexity among three computation problems on maximum number of edge-disjoint \(s\)-\(t\) paths in a probabilistic graph	1994-09-25	Paper

This page was built for person: Peng Cheng