3268 search results - page 128 / 654 » The hub number of a graph |
180
click to vote
AAIM
2007
Springer
16 years 19 days ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
185
click to vote
WDAG
2005
Springer
15 years 12 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 ...
224
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...