|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 18 occurrences of 12 keywords
|
|
|
Results
Found 27 publication records. Showing 27 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
83 | Zhengbing Bian, Qian-Ping Gu |
Computing Branch Decomposition of Large Planar Graphs. |
WEA |
2008 |
DBLP DOI BibTeX RDF |
computational study, Graph algorithms, planar graphs, algorithm engineering, branch-decomposition |
45 | Marjan Marzban, Qian-Ping Gu, Xiaohua Jia |
Computational Study on Dominating Set Problem of Planar Graphs. |
COCOA |
2008 |
DBLP DOI BibTeX RDF |
PLANAR DOMINATING SET, computational study, data reduction, fixed-parameter algorithms, branch-decomposition |
38 | Illya V. Hicks |
Branchwidth and Branch Decompositions. |
Encyclopedia of Optimization |
2009 |
DBLP DOI BibTeX RDF |
Branchwidth, Graph minors theorem, Branch-decomposition-based algorithm, Tangle, Branch decomposition |
37 | Frederic Dorn, Jan Arne Telle |
Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm. |
LATIN |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Hisao Tamaki |
A Linear Time Heuristic for the Branch-Decomposition of Planar Graphs. |
ESA |
2003 |
DBLP DOI BibTeX RDF |
|
30 | Petr Hlinený, Sang-il Oum |
Finding Branch-Decompositions and Rank-Decompositions. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
Rank-width, fixed parameter tractable algorithm, graph, matroid, clique-width, branch-width |
29 | Qian-Ping Gu, Hisao Tamaki |
Constant-Factor Approximations of Branch-Decomposition and Largest Grid Minor of Planar Graphs in O(n1 + ε) Time. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
Graph algorithms, graph minors, branch-decompositions |
24 | Qian-Ping Gu, Hisao Tamaki |
Optimal branch-decomposition of planar graphs in O(n3) Time. |
ACM Trans. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
planar graphs, Branch-decompositions |
24 | Qian-Ping Gu, Hisao Tamaki |
Optimal Branch-Decomposition of Planar Graphs in O(n3) Time. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Marko Samer |
Hypertree-decomposition via Branch-decomposition. |
IJCAI |
2005 |
DBLP BibTeX RDF |
|
18 | Hans L. Bodlaender, Dimitrios M. Thilikos |
Constructive Linear Time Algorithms for Branchwidth. |
ICALP |
1997 |
DBLP DOI BibTeX RDF |
|
15 | Takaaki Fujita |
Exploring two concepts: branch decomposition and weak ultrafilter on connectivity system. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Florian Wetzels, Heike Leitte, Christoph Garth |
Branch Decomposition-Independent Edit Distances for Merge Trees. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Florian Wetzels, Heike Leitte, Christoph Garth |
Branch Decomposition-Independent Edit Distances for Merge Trees. |
Comput. Graph. Forum |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Qian-Ping Gu, Gengchun Xu |
Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs. |
Discret. Appl. Math. |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Caleb C. Fast, Illya V. Hicks |
A Branch Decomposition Algorithm for the p-Median Problem. |
INFORMS J. Comput. |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Yingjie Xia, Mingzhe Zhu, Qianping Gu, Luming Zhang, Xuelong Li 0001 |
Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs. |
Inf. Sci. |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Kin Cheong Sou |
A branch-decomposition approach to power network design. |
ACC |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Qianping Gu, Gengchun Xu |
Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs. |
CoRR |
2014 |
DBLP BibTeX RDF |
|
15 | Himangshu Saikia, Hans-Peter Seidel, Tino Weinkauf |
Extended Branch Decomposition Graphs: Structural Comparison of Scalar Data. |
Comput. Graph. Forum |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Qian-Ping Gu, Gengchun Xu |
Near-Linear Time Constant-Factor Approximation Algorithm for Branch-Decomposition of Planar Graphs. |
WG |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Jing Ma, Susan Margulies, Illya V. Hicks, Edray Goins |
Branch decomposition heuristics for linear matroids. |
Discret. Optim. |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Qian-Ping Gu, Hisao Tamaki |
Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n1+ϵ) time. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
15 | Zhengbing Bian, Qian-Ping Gu, Marjan Marzban, Hisao Tamaki, Yumi Yoshitake |
Empirical Study on Branchwidth and Branch Decomposition of Planar Graphs. |
ALENEX |
2008 |
DBLP DOI BibTeX RDF |
|
15 | James F. Geelen, Bert Gerards, Neil Robertson 0001, Geoff Whittle |
Obstructions to branch-decomposition of matroids. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
15 | William J. Cook, Paul D. Seymour |
Tour Merging via Branch-Decomposition. |
INFORMS J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
14 | Fedor V. Fomin, Dimitrios M. Thilikos |
A Simple and Fast Approach for Solving Problems on Planar Graphs. |
STACS |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #27 of 27 (100 per page; Change: )
|
|