3267 search results - page 63 / 654 » Generalized quasirandom graphs |
ISAAC
2010
Springer
14 years 9 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...
WDAG
2004
Springer
15 years 4 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...
COSIT
2009
Springer
15 years 5 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...
JGAA
2007
14 years 11 months 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 ...
DAM
2002
14 years 11 months 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...