MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "The MINSUMCUT Problem." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 3 documents found, showing 1 through 3.
ATOM RSS
  • Layout Problems on Lattice Graphs  
  • by Josep Díaz, Mathew D. Penrose, Jordi Petit, María Serna — 1999 — Computing and Combinatorics, volume 1627 of Lecture Notes in Computer Science
  • … also give a similar result for the MinSumCut problem. To cover the case � C0 = ∅, we use the convention…
  • Cited by 7 (6 self) – Add To MetaCart
  • Linear Orderings of Random Geometric Graphs  
  • by Josep Diaz, Mathew Penrose, Jordi Petit, Maria Serna, Departament De Llenguatges I Sistemes — 1997 — Graph Theoretic Concepts in Computer Science
  • … not obtain similar results for MinSumCut, MinLA and Bisection. However, for the Bisection problem, we…
  • Cited by 8 (4 self) – Add To MetaCart
Help! Showing 1 through 3.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB