193 search results - page 10 / 39 » Duality in Infinite Graphs |
72
Voted
TALG
2008
14 years 9 months ago
2008
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
ENDM
2008
14 years 9 months ago
2008
The structure of all known infinite families of crossing
NETWORKS
2008
14 years 9 months ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
102
click to vote
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optim...
COMBINATORICS
1999
14 years 9 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...