1327 search results - page 151 / 266 » Path following algorithm for the graph matching problem |
135
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
148
Voted
EACL
2009
ACL Anthology
15 years 1 months ago
2009
ACL Anthology
like text summarisation requires a means of producing novel summary sentences. In order to improve the grammaticality of the generated sentence, we model a global (sentence) level...
143
click to vote
ISPD
2010
ACM
15 years 10 months ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
116
click to vote
SIAMDM
2008
15 years 3 months ago
2008
A hypergraph pair is a pair (G, H) where G and H are hypergraphs on the same set of vertices. We extend the definitions of hypertree-width [7] and generalised hypertree-width [8] ...
120
click to vote
AVI
2006
15 years 5 months ago
2006
Graphs provide good representations for many domains. Interactive graph-based interfaces are desireable to browse and edit data for these domains. However, as graphs increase in s...