|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 16 occurrences of 14 keywords
|
|
|
Results
Found 26 publication records. Showing 26 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
87 | Mohammod Abul Kashem, M. Ziaur Rahman |
An Optimal Parallel Algorithm for c-Vertex-Ranking of Trees.  |
ISAAC  |
2003 |
DBLP DOI BibTeX RDF |
Ordered coloring, Separator-tree, Vertex-ranking, Parallel algorithm, Tree |
74 | Ruei-Yuan Chang, Guanling Lee, Sheng-Lung Peng |
Minimum Vertex Ranking Spanning Tree Problem on Some Classes of Graphs.  |
ICIC (2)  |
2008 |
DBLP DOI BibTeX RDF |
|
67 | Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza |
Ranking of Graphs.  |
WG  |
1994 |
DBLP DOI BibTeX RDF |
|
51 | Mohammod Abul Kashem, Xiao Zhou 0001, Takao Nishizeki |
An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees.  |
ISPAN  |
1997 |
DBLP DOI BibTeX RDF |
Separator tree, Vertex-ranking, Parallel algorithm, Treewidth, Partial k-tree |
37 | Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller |
A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems.  |
Algorithmica  |
2002 |
DBLP DOI BibTeX RDF |
Asteroidal triple, Minimum fill-in, Vertex ranking, Algorithm, Complexity, Graph, Treewidth |
36 | Ruei-Yuan Chang, Guanling Lee, Sheng-Lung Peng |
Minimum Vertex Ranking Spanning Tree Problem on Permutation Graphs.  |
TAMC  |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller |
On Vertex Ranking for Permutations and Other Graphs.  |
STACS  |
1994 |
DBLP DOI BibTeX RDF |
|
31 | Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller |
A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking.  |
WG  |
1998 |
DBLP DOI BibTeX RDF |
|
26 | Ton Kloks, Haiko Müller, C. K. Wong |
Vertex Ranking of Asteroidal Triple-Free Graphs.  |
ISAAC  |
1996 |
DBLP DOI BibTeX RDF |
|
23 | Sudipto Guha |
Nested Graph Dissection and Approximation Algorithms.  |
FOCS  |
2000 |
DBLP DOI BibTeX RDF |
nested graph dissection, nested dissection paradigm, chordal completion size, polynomial term, vertex ranking, approximation algorithms, computational geometry, graph theory, polynomials, upper bound, approximation theory, planar embedding |
19 | Dariusz Dereniowski, Marek Kubale |
Cholesky Factorization of Matrices in Parallel and Ranking of Graphs.  |
PPAM  |
2003 |
DBLP DOI BibTeX RDF |
|
17 | Prosenjit Bose, Vida Dujmovic, Mehrnoosh Javarsineh, Pat Morin |
Asymptotically Optimal Vertex Ranking of Planar Graphs.  |
CoRR  |
2020 |
DBLP BibTeX RDF |
|
17 | Yang Zhou 0001, Jiaxiang Ren 0001, Sixing Wu, Dejing Dou, Ruoming Jin, Zijie Zhang 0001, Pengwei Wang 0004 |
Semi-supervised Classification-based Local Vertex Ranking via Dual Generative Adversarial Nets.  |
IEEE BigData  |
2019 |
DBLP DOI BibTeX RDF |
|
17 | Daniel C. McDonald |
On-Line Vertex Ranking of Trees.  |
SIAM J. Discret. Math.  |
2015 |
DBLP DOI BibTeX RDF |
|
17 | Guy Even, Shakhar Smorodinsky |
Hitting Sets Online and Vertex Ranking.  |
ESA  |
2011 |
DBLP DOI BibTeX RDF |
|
17 | Ruben van der Zwaan |
Vertex Ranking with Capacity.  |
SOFSEM  |
2010 |
DBLP DOI BibTeX RDF |
|
17 | Dariusz Dereniowski |
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs.  |
Discuss. Math. Graph Theory  |
2009 |
DBLP DOI BibTeX RDF |
|
17 | Ruo-Wei Hung |
Optimal vertex ranking of block graphs.  |
Inf. Comput.  |
2008 |
DBLP DOI BibTeX RDF |
|
17 | Shin-ichi Nakayama, Shigeru Masuyama |
A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs.  |
IEICE Trans. Inf. Syst.  |
2006 |
DBLP DOI BibTeX RDF |
|
17 | Keizo Miyata, Shigeru Masuyama, Shin-ichi Nakayama, Liang Zhao 0013 |
Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem.  |
Discret. Appl. Math.  |
2006 |
DBLP DOI BibTeX RDF |
|
17 | Mohammod Abul Kashem, M. Ziaur Rahman |
An optimal parallel algorithm for c-vertex-ranking of trees.  |
Inf. Process. Lett.  |
2004 |
DBLP DOI BibTeX RDF |
|
17 | Shin-ichi Nakayama, Shigeru Masuyama |
An Algorithm for Solving the Minimum Vertex Ranking Spanning Tree Problem on Interval Graphs.  |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.  |
2003 |
DBLP BibTeX RDF |
|
17 | Sun-Yuan Hsieh |
On vertex ranking of a starlike graph.  |
Inf. Process. Lett.  |
2002 |
DBLP DOI BibTeX RDF |
|
17 | Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller |
On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs.  |
Discret. Appl. Math.  |
1999 |
DBLP DOI BibTeX RDF |
|
17 | Ton Kloks, Haiko Müller, C. K. Wong |
Vertex Ranking of Asteroidal Triple-Free Graphs.  |
Inf. Process. Lett.  |
1998 |
DBLP DOI BibTeX RDF |
|
17 | Patrick McKeown |
Technical Note - A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem.  |
Oper. Res.  |
1975 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #26 of 26 (100 per page; Change: )
|
|