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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1971-2016
024619712016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
Most existing collaborative filtering techniques have focused on modeling the binary relation of users to items by extracting… (More)
  • table 2
  • figure 2
  • figure 1
  • figure 3
  • table 3
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2011
2011
We consider the extension of the last-in-first-out graph searching game of Giannopoulou and Thilikos to digraphs. We show that… (More)
  • figure 1
Is this relevant?
2004
2004
Graphs form the foundation of many real-world datasets ranging from Internet connectivity to social networks. Yet despite this… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1998
1998
A vertex (edge) coloring φ : V → {1, 2, . . . , t} (φ′ : E → {1, 2, . . . , t}) of a graph G = (V,E) is a vertex (edge) t-ranking… (More)
Is this relevant?
1998
1998
A subset A of the vertices of a graph G is an asteroidal set if for each vertex a ∈ A, the set A\{a} is contained in one… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Various parameters of graphs connected to sparse matrix factoriza-tion and other applications can be approximated using an… (More)
Is this relevant?
1989
1989
 
Is this relevant?