4865 search results - page 223 / 973 » The Complexity of Graph Connectivity |
155
click to vote
ICMT
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Graph transformation has a well-established theory and associated tools that can be used to perform model transformations. However, the lack of a construct to match and t...
163
Voted
CORR
2012
Springer
14 years 22 days ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
138
Voted
GC
2006
Springer
15 years 5 months ago
2006
Springer
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Pr...
145
click to vote
SIAMCOMP
2002
15 years 4 months ago
2002
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
130
Voted
ACL
2009
15 years 2 months ago
2009
Identifying whether a multi-word expression (MWE) is compositional or not is important for numerous NLP applications. Sense induction can partition the context of MWEs into semant...