Sciweavers

Share
16 search results - page 2 / 4
» Bounds for the Real Number Graph Labellings and Application ...
Sort
View
JCO
2007
113views more  JCO 2007»
11 years 5 months ago
Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
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...
Jerrold R. Griggs, Xiaohua Teresa Jin
IWDC
2005
Springer
156views Communications» more  IWDC 2005»
11 years 11 months ago
Labeling Schemes for Tree Representation
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predeļ¬ned numbering on the ports of each node. The al...
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, A...
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
12 years 3 months ago
Compact Ancestry Labeling Schemes for XML Trees
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...
Fraigniaud Pierre, Korman Amos
JCP
2008
171views more  JCP 2008»
11 years 5 months ago
Mining Frequent Subgraph by Incidence Matrix Normalization
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...
Jia Wu, Ling Chen
SIROCCO
2007
11 years 7 months ago
Fast Periodic Graph Exploration with Constant Memory
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...
Leszek Gasieniec, Ralf Klasing, Russell A. Martin,...
books