1986 search results - page 204 / 398 » Path Separability of Graphs |
116
Voted
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
116
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
134
click to vote
MFCS
2007
Springer
15 years 8 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
133
click to vote
KI
2005
Springer
15 years 7 months ago
2005
Springer
To reason about geographical objects, it is not only necessary to have more or less complete information about where these objects are located in space, but also how they can chang...
104
Voted
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...