3471 search results - page 136 / 695 » Obstacle Numbers of Graphs |
WDAG
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
PKDD
2004
Springer
14 years 3 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...
ISSS
1996
IEEE
14 years 1 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...
AINA
2008
IEEE
13 years 11 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...
SODA
2008
ACM
13 years 11 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...