9532 search results - page 273 / 1907 » Logic, Graphs, and Algorithms |
148
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
179
click to vote
CORR
2008
Springer
15 years 6 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...
179
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
180
click to vote
GLOBECOM
2006
IEEE
16 years 19 days ago
2006
IEEE
Abstract— A multi-channel wireless mesh network (MCWMN) consists of a number of stationary wireless routers, where each router is equipped with multiple network interface cards (...
197
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
The optimal state minimization problem is to select a reduced state machine having the best logic implementation over all possible state reductions and encodings. A recent algorit...