22 search results - page 1 / 5 » Edge-Isoperimetric Problems for Cartesian Powers of Regular ... |
WG
2001
Springer
13 years 9 months ago
2001
Springer
We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objectives is to extend the list of graphs for whose cartesian powers the lexicograph...
DM
2008
13 years 4 months ago
2008
We introduce a new graph for all whose cartesian powers the vertex isoperimetric problem has nested solutions. This is the fourth kind of graphs with this property besides the wel...
SIAMDM
2008
13 years 4 months ago
2008
The power system monitoring problem asks for as few as possible measurement devices to be put in an electric power system. The problem has a graph theory model involving power dom...
NJC
2000
13 years 4 months ago
2000
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
ICDE
2011
IEEE
12 years 8 months ago
2011
IEEE
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...