1729 search results - page 16 / 346 » Bound Graph Polysemy |
133
click to vote
JCT
2007
15 years 4 months ago
2007
We conjecture that every planar graph of odd-girth 2k + 1 admits a homomorphism to Cayley graph C(Z2k+1 2 , S2k+1), with S2k+1 being the set of (2k + 1)vectors with exactly two co...
125
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
We introduce the concept of multi-directional width-bounded geometric separator and get improved separator for the grid graph, which improves exact algorithm for the protein foldin...
181
click to vote
SIAMCOMP
2011
14 years 7 months ago
2011
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an ex...
119
click to vote
ICPR
2004
IEEE
16 years 5 months ago
2004
IEEE
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
137
click to vote
EOR
2008
15 years 4 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...