|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2 occurrences of 2 keywords
|
|
|
Results
Found 24 publication records. Showing 24 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
56 | Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat |
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
Gomory-Hu tree, cut tree, steiner edge connectivity, edge connectivity, min cut |
46 | Prabha Sharma |
Algorithms for the optimum communication spanning tree problem. |
Ann. Oper. Res. |
2006 |
DBLP DOI BibTeX RDF |
Cost of communication, Cut-tree, Star-tree, Adjacent spanning tree, Adjacent basic feasible solution |
27 | Volker Kaibel, Matthias Peinhardt, Marc E. Pfetsch |
Orbitopal Fixing. |
IPCO |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Laszlo Ladányi, Ted K. Ralphs, Leslie E. Trotter Jr. |
Branch, Cut, and Price: Sequential and Parallel. |
Computational Combinatorial Optimization |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Luís M. S. Russo |
Searching for a Feedback Vertex Set with the link-cut tree. |
J. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Charles Maske, Jaime Cohen, Elias P. Duarte Jr. |
Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient Graph Contractions. |
Algorithmica |
2020 |
DBLP DOI BibTeX RDF |
|
15 | On-Hei Solomon Lo, Jens M. Schmidt |
A Cut Tree Representation for Pendant Pairs. |
ISAAC |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Jaime Cohen, Luiz A. Rodrigues, Elias P. Duarte Jr. |
Parallel cut tree algorithms. |
J. Parallel Distributed Comput. |
2017 |
DBLP DOI BibTeX RDF |
|
15 | On-Hei Solomon Lo, Jens M. Schmidt |
Cut Tree Structures with Applications on Contraction-Based Sparsification. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
15 | Gabriel Berzunza Ojeda |
The cut-tree of large trees with small heights. |
Random Struct. Algorithms |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Takuya Akiba, Yoichi Iwata, Yosuke Sameshima, Naoto Mizuno, Yosuke Yano |
Cut Tree Construction from Massive Graphs. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
15 | Takuya Akiba, Yoichi Iwata, Yosuke Sameshima, Naoto Mizuno, Yosuke Yano |
Cut Tree Construction from Massive Graphs. |
ICDM |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Tanja Hartmann, Dorothea Wagner |
Fast and Simple Fully-Dynamic Cut Tree Construction. |
ISAAC |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Jaime Cohen, Luiz A. Rodrigues, Elias P. Duarte Jr. |
A Parallel Implementation of Gomory-Hu's Cut Tree Algorithm. |
SBAC-PAD |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Jaime Cohen, Luiz A. Rodrigues, Fabiano Silva, Renato Carmo, André Luiz Pires Guedes, Elias P. Duarte Jr. |
Parallel Implementations of Gusfield's Cut Tree Algorithm. |
ICA3PP (1) |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Anne M. Schwahn |
Minimum cut tree games. |
GAMENETS |
2009 |
DBLP DOI BibTeX RDF |
|
15 | Barna Saha, Pabitra Mitra |
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree. |
SDM |
2007 |
DBLP DOI BibTeX RDF |
|
15 | W. A. Barrett |
Biometrics of Cut Tree Faces. |
SCSS (1) |
2007 |
DBLP DOI BibTeX RDF |
|
15 | Alex Benton, Joseph O'Rourke |
Unfolding Polyhedra via Cut-Tree Truncation. |
CCCG |
2007 |
DBLP BibTeX RDF |
|
15 | Dominique Barth, Pascal Berthomé, Madiagne Diallo, Afonso Ferreira |
Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations. |
Discret. Optim. |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Barna Saha, Pabitra Mitra |
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree. |
ICDM Workshops |
2006 |
DBLP DOI BibTeX RDF |
|
15 | Andrew V. Goldberg, Kostas Tsioutsiouliklis |
Cut Tree Algorithms: An Experimental Study. |
J. Algorithms |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Andrew V. Goldberg, Kostas Tsioutsiouliklis |
Cut Tree Algorithms. |
SODA |
1999 |
DBLP BibTeX RDF |
|
15 | Levent Kandiller |
A cell formation algorithm: Hypergraph approximation - Cut tree. |
Eur. J. Oper. Res. |
1998 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #24 of 24 (100 per page; Change: )
|
|