Sciweavers

871 search results - page 52 / 175
» The vertex-cover polynomial of a graph
Sort
View
JCT
2007
111views more  JCT 2007»
14 years 9 months ago
Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements
Hyperplanes of the form xj = xi + c are called affinographic. For an affinographic hyperplane arrangement in Rn, such as the Shi arrangement, we study the function f(m) that counts...
David Forge, Thomas Zaslavsky
JCO
2006
126views more  JCO 2006»
14 years 9 months ago
Minimum power assignment in wireless ad hoc networks with spanner property
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
Yu Wang 0003, Xiang-Yang Li
COCOON
1999
Springer
15 years 2 months ago
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
Xuemin Lin, Peter Eades
IJCAI
2001
14 years 11 months ago
Graph Theoretical Characterization and Computation of Answer Sets
We give a graph theoretical characterization of answer sets of normal logic programs. We show that there is a one-to-one correspondence between answer sets and a special, non-stan...
Thomas Linke
JCT
2008
100views more  JCT 2008»
14 years 9 months ago
Optimal distortion embeddings of distance regular graphs into Euclidean spaces
ABSTRACT. In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least dist...
Frank Vallentin