1729 search results - page 84 / 346 » Bound Graph Polysemy |
170
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
141
Voted
CIE
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
150
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
113
Voted
IJCAI
2007
15 years 6 months ago
2007
Accurate entity resolution is sometimes impossible simply due to insufficient information. For example, in research paper author name resolution, even clever use of venue, title ...
142
click to vote
GC
2007
Springer
15 years 4 months ago
2007
Springer
Let G be a connected graph of order n and girth g. If dG(u) + dG(v) ≥ n − 2g + 5 for any two non-adjacent vertices u and v, then G is up-embeddable. Further more, the lower bou...