463 search results - page 12 / 93 » The lattice dimension of a graph |
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
ICTAI
2000
IEEE
15 years 2 months ago
2000
IEEE
In this paper, we address the problem of consistency checking for Euclidean spatial constraints. A dimension graph representation is proposed to maintain the Euclidean spatial con...
IDEAS
2005
IEEE
15 years 3 months ago
2005
IEEE
The recent proliferation of XML-based standards and technologies for managing data on the Web demonstrates the need for effective and efficient management of treestructured data....
DM
2002
14 years 9 months ago
2002
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
84
Voted
DAM
2007
14 years 9 months ago
2007
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...