1538 search results - page 88 / 308 » Spectral Techniques in Graph Algorithms |
118
click to vote
SMI
2003
IEEE
15 years 6 months ago
2003
IEEE
In this paper, we describe a novel method for searching and comparing 3D objects. The method encodes the geometric and topological information in the form of a skeletal graph and ...
108
click to vote
CSR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been ...
124
click to vote
PODC
2006
ACM
15 years 7 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
106
click to vote
DATE
2007
IEEE
15 years 7 months ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
105
click to vote
ICHIT
2009
Springer
15 years 8 months ago
2009
Springer
Discovering the AS paths between two ASes are invaluable for a wide area of network research and application activities. The traditional techniques for path discovery require dire...