6740 search results - page 325 / 1348 » An s -Hamiltonian Line Graph Problem |
183
click to vote
PKDD
2004
Springer
15 years 9 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...
136
click to vote
ASP
2003
Springer
15 years 9 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. ...
133
click to vote
ISSS
1996
IEEE
15 years 8 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...
156
click to vote
PODS
1993
ACM
15 years 8 months ago
1993
ACM
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
152
click to vote
FASE
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicab...