Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Cycle rank

Known as: Rank coloring, Vertex ranking number, Ordered chromatic number 
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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Recommender systems form the backbone of many interactive systems. They incorporate user feedback to personalize the user… Expand
  • figure 1
  • table I
  • figure 2
  • table II
  • figure 3
Is this relevant?
Review
2015
Review
2015
Most existing collaborative filtering techniques have focused on modeling the binary relation of users to items by extracting… Expand
  • table 2
  • figure 2
  • figure 1
  • figure 3
  • table 3
Is this relevant?
2014
2014
The width measure treedepth, also known as vertex ranking, centered coloring and elimination tree height, is a well-established… Expand
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We describe a parallel library written with message-passing (MPI) calls that allows algorithms to be expressed in the MapReduce… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Graphs form the foundation of many real-world datasets ranging from Internet connectivity to social networks. Yet despite this… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
The vertex ranking problem is closely related to the problem of finding the elimination tree of minimum height for a given graph… Expand
Is this relevant?
2003
2003
For a positive integer c, a c-vertex-ranking of a graph G = (V,E) is a labeling of the vertices of G with integers such that, for… Expand
Is this relevant?
2002
2002
Abstract A vertex coloring c :V→{1,2,…,t} of a graph G =( V , E ) is a vertex t -ranking if for any two vertices of the same… Expand
Is this relevant?
1995
1995
We present an efficient algorithm for computing the vertex ranking number of an asteroidal triple-free graph. Its running time is… Expand
Is this relevant?
1989
1989
It has been conjectured by C. van Nuffelen that the chromatic number of any graph with at least one edge does not exceed the rank… Expand
Is this relevant?