16 search results - page 2 / 4 » Bounds for the Real Number Graph Labellings and Application ... |
JCO
2007
13 years 4 months ago
2007
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance c...
IWDC
2005
Springer
13 years 10 months ago
2005
Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
SODA
2010
ACM
14 years 1 months ago
2010
ACM
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
JCP
2008
13 years 4 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
SIROCCO
2007
13 years 6 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...