Searching for "Computing Mimicking Networks." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees
by Torben Hagerup, Naomi Nishimura, Jyrki Katajainen, Prabhakar Ragde — 1995
… is not constant but O( p log log n), our algorithm (excluding the computation of a mimicking network) is still…
Cited by 6 (1 self) – Add To MetaCart

All-Pairs Min-Cut in Sparse Networks
by Shiva Chaudhuri, Srinivasa R. Arikati, Srinivasa R. Arikati, Christos D. Zaroliagis, Christos D. Zaroliagis — 1996
…) is the time required to compute an s-t max-flow in G. Suppose we are given the mimicking networks of a number…
Cited by 5 (1 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB