3267 search results - page 63 / 654 » Generalized quasirandom graphs |
109
click to vote
ISAAC
2010
Springer
14 years 10 months ago
2010
Springer
It has been conjectured by Golumbic and Monma in 1984 that the intersection of tolerance and cocomparability graphs coincides with bounded tolerance graphs. Since cocomparability g...
106
Voted
WDAG
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
103
Voted
COSIT
2009
Springer
15 years 7 months ago
2009
Springer
Spatial information requires models which allow us to answer ‘maybe’ to questions asking whether a location lies within a region. At the same time, models must account for data...
100
click to vote
JGAA
2007
15 years 19 days ago
2007
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
83
Voted
DAM
2002
15 years 17 days ago
2002
A graph is said to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on t...