9532 search results - page 373 / 1907 » Logic, Graphs, and Algorithms |
165
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
183
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...
142
Voted
JGT
2008
15 years 6 months ago
2008
The square G2 of a graph G is the graph with the same vertex set as G and with two vertices adjacent if their distance in G is at most 2. Thomassen showed that for a planar graph ...
167
click to vote
JGT
2007
15 years 6 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
240
click to vote
ENDM
2000
15 years 6 months ago
2000
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...