320 search results - page 32 / 64 » Parity Problems in Planar Graphs |
144
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
145
click to vote
WADS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
127
click to vote
IJCM
2008
15 years 4 months ago
2008
Abstract. We analyze Roman domination from a parameterized perspective. More specifically, we prove that this problem is W[2]-complete for general graphs. However, parameterized al...
141
click to vote
ICCV
2007
IEEE
15 years 10 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
163
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...