3211 search results - page 130 / 643 » On the Grundy Number of a Graph |
223
click to vote
PKDD
2004
Springer
15 years 11 months ago
2004
Springer
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
166
click to vote
ISSS
1996
IEEE
15 years 10 months ago
1996
IEEE
In this paper we present the problem of flow graph balancing for minimizingthe required memory bandwidth. Our goal is to minimize the required memory bandwidth within the given cy...
179
click to vote
AINA
2008
IEEE
15 years 8 months ago
2008
IEEE
A link farm is a set of web pages constructed to mislead the importance of target pages in search engine results by boosting their link-based ranking scores. In this paper, we int...
146
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
168
click to vote
ALGORITHMICA
2007
15 years 6 months ago
2007
In this paper we consider 3-dimensional generic bar-and-joint realizations of squares of graphs. These graphs are also called molecular graphs due to their importance in the study...