3757 search results - page 162 / 752 » The overlap number of a graph |
151
click to vote
ICDM
2006
IEEE
16 years 14 days ago
2006
IEEE
Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algo...
189
click to vote
COCOON
2005
Springer
15 years 12 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
161
click to vote
WAW
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we study the size of generalised dominating sets in two graph processes which are widely used to model aspects of the world-wide web. On the one hand, we show that gr...
158
click to vote
GD
2009
Springer
15 years 11 months ago
2009
Springer
To produce high quality drawings of graphs with nodes drawn as shapes it is important to find routes for the edges which do not intersect node boundaries. Recent work in this area...
232
click to vote
ICALP
1995
Springer
15 years 10 months ago
1995
Springer
The problem to determine whether a given k-colored graph is a subgraph of a properly colored interval graph has an application in DNA physical mapping. In this paper, we study the...