3268 search results - page 89 / 654 » The hub number of a graph |
165
click to vote
JGAA
2007
15 years 6 months ago
2007
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one c...
180
click to vote
NIPS
2008
15 years 7 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
223
click to vote
IPL
2006
15 years 6 months ago
2006
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping from V (G) to V (H), that is (x)(y) is an arc in H whenever xy is an arc in G. The orie...
160
click to vote
AAAI
2007
15 years 8 months ago
2007
We describe a novel approach to parallelizing graph search using structured duplicate detection. Structured duplicate detection was originally developed as an approach to external...
148
click to vote
ACL
1998
15 years 7 months ago
1998
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...