6740 search results - page 1133 / 1348 » An s -Hamiltonian Line Graph Problem |
162
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
140
click to vote
ICCAD
2001
IEEE
16 years 1 months ago
2001
IEEE
Abstract: We propose an effective algorithm for power optimization in behavioral synthesis. In previous work, it has been shown that several hardware allocation/binding problems fo...
145
click to vote
WISEC
2009
ACM
15 years 11 months ago
2009
ACM
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
131
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
162
Voted
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...