Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,209,253 papers from all fields of science
Search
Sign In
Create Free Account
Cycle rank
Known as:
Rank coloring
, Vertex ranking number
, Ordered chromatic number
Expand
In graph theory, the cycle rank of a directed graph is a digraph connectivity measure proposed first by Eggan and Büchi (). Intuitively, this concept…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
20 relations
Approximation algorithm
Cholesky decomposition
Circuit rank
Circular coloring
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A Narrative Study in Ramsey Graph Theory using Rank Coloring
R. Angayarkanni
2016
Corpus ID: 2934676
Now a day’s Graph Ramsey Theory has grown to one of the most familiar active areas. A major impetus behind the early development…
Expand
2009
2009
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs
D. Dereniowski
Discussiones Mathematicae Graph Theory
2009
Corpus ID: 12792726
A vertex k-ranking of a simple graph is a coloring of its ver- tices with k colors in such a way that each path connecting two…
Expand
2006
2006
An On-Line Algorithm for Edge-Ranking of Trees
Muntasir Raihan Rahman
,
M. Kashem
,
Md. Ehtesamul Haque
2006
Corpus ID: 43302821
An edge-ranking of a graph G is a labeling of the edges of G with positive integers such that every path between two edges with…
Expand
Review
2004
Review
2004
Minimum Vertex Ranking Spanning Tree Problem(TUTORIAL SPEECH)
Shigeru Masuyama
2004
Corpus ID: 118871838
Review
2004
Review
2004
T1 MINIMUM VERTEX RANKING SPANNING TREE PROBLEM : A TUTORIAL(Tutorial speech)
Shigeru Masuyama
2004
Corpus ID: 118547866
2004
2004
Submission for Discrete Applied Mathematics ( DAM ) Title : NP-hardness Proof and an Approximation Algorithm for the Minimum Vertex Ranking Spanning Tree Problem
Keizo Miyata
,
Shigeru Masuyama
,
Shin-ichi Nakayama
,
Liang Zhao
2004
Corpus ID: 15777059
The minimum vertex ranking spanning tree problem (MVRST) is to find a spanning tree of G whose vertex ranking is minimum. In this…
Expand
2003
2003
An Algorithm for Solving the Minimum Vertex Ranking Spanning Tree Problem on Interval Graphs
Shin-ichi Nakayama
,
Shigeru Masuyama
IEICE Transactions on Fundamentals of Electronics…
2003
Corpus ID: 117182015
1999
1999
On the Vertex Ranking Problem for d-trapezoid Graphs and for Circular-arc Graphs
J. Deogun
,
T. Kloks
,
D. Kratsch
,
H. Müller
1999
Corpus ID: 11045881
We present polynomial time algorithms which solve the vertex ranking problem for circular-arc graphs and for d-trapezoid graphs…
Expand
1997
1997
Generalized Vertex-Rankings of Partial k-trees
A. Kashem
,
Xiaoping Zhou
,
Takao Nishizeki
International Computing and Combinatorics…
1997
Corpus ID: 18339645
A c-vertex-ranking of a graph G for a positive integer c is a labeling of the vertices of G with integers such that, for any…
Expand
1997
1997
On the function \sandwiched" between (G) and (G)
V. Dobrynin
1997
Corpus ID: 125521662
A new function of a graph G is presented. Say that a matrix B that is indexed by vertices of G is feasible for G if it is real…
Expand