9532 search results - page 223 / 1907 » Logic, Graphs, and Algorithms |
189
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
161
click to vote
DAGSTUHL
2000
15 years 7 months ago
2000
Algorithmic experiments yield large amounts of data that depends on many parameters. This paper collects a number of rules for presenting this data in concise, meaningful, understa...
143
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A dominating set D of a graph G = (V, E) is a subset of vertices such that every vertex in V \ D has at least one neighbour in D. Moreover if D is an independent set, i.e. no verti...
163
click to vote
NETWORKS
2006
15 years 5 months ago
2006
In a bidirected graph, each end of each edge is independently oriented. We show how to express any column of the incidence matrix as a half-integral linear combination of any colum...