109 search results - page 6 / 22 » Vertex Ranking with Capacity |
SIAMDM
2008
14 years 11 months ago
2008
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
102
click to vote
FAW
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...
EJC
2007
14 years 11 months ago
2007
The cone ˆG of a finite graph G is obtained by adding a new vertex p, called the cone point, and joining each vertex of G to p by a simple edge. We show that the rank of the red...
DM
2008
14 years 11 months ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
80
Voted
EOR
2006
14 years 11 months ago
2006
Recent work on the location of perinatal facilities in the municipality of Rio de Janeiro resulted in the development of an uncapacitated, three-level hierarchical model. An impor...