823 search results - page 116 / 165 » Brick partitions of graphs |
136
click to vote
TCAD
2002
15 years 1 months ago
2002
The design of programmable logic architectures and supporting computer-aided design tools fundamentally requires both a good understanding of the combinatorial nature of netlist gr...
119
click to vote
COMPGEOM
2003
ACM
15 years 7 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
129
click to vote
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
124
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...
141
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...