1199 search results - page 145 / 240 » Graph Theory |
193
Voted
FCA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. A main goal of Formal Concept Analysis from its very beginning has been the support of rational communication. The source of this goal lies in our understanding of mathem...
139
click to vote
EJC
2008
15 years 4 months ago
2008
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
126
click to vote
WWW
2005
ACM
16 years 4 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
129
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
147
Voted
GIS
2007
ACM
15 years 8 months ago
2007
ACM
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...