288 search results - page 33 / 58 » Linearly bounded infinite graphs |
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
DAM
2007
13 years 7 months ago
2007
We prove that local complementation and vertex deletion, operations from which vertexminors are defined, can simulate edge contractions. As an application, we prove that the rank...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
— We introduce a hypergraph based interference model for scheduling in wireless networks. As a generalization of the graph model, hypergraph considers the conflicts caused by su...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
SIAMDM
2008
13 years 7 months ago
2008
Let C be a code of length n over an alphabet of size q. A word d is a descendant of a pair of codewords x, y C if di {xi, yi} for 1 i n. A code C is an identifiable parent prop...