5889 search results - page 275 / 1178 » Graph Layout Problems |
189
click to vote
AAIM
2007
Springer
16 years 26 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...
188
click to vote
WDAG
2005
Springer
16 years 4 days 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 ...
231
click to vote
PKDD
2004
Springer
16 years 20 hour 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...
165
click to vote
ASP
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
169
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...