1327 search results - page 176 / 266 » Path following algorithm for the graph matching problem |
113
Voted
APPROX
2005
Springer
15 years 7 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
123
click to vote
KDD
2005
ACM
16 years 2 months ago
2005
ACM
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
ICCAD
2005
IEEE
15 years 10 months ago
2005
IEEE
Technology mapping based on DAG-covering suffers from the problem of structural bias: the structure of the mapped netlist depends strongly on the subject graph. In this paper we ...
116
click to vote
GG
2004
Springer
15 years 7 months ago
2004
Springer
Graphs are well-known, well-understood, and frequently used means to depict networks of related items. They are successfully used as the underlying mathematical concept in various ...
125
click to vote
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
Battery lifetime, a primary design constraint for mobile embedded systems, has been shown to depend heavily on the load current profile. This paper explores how scheduling guidel...