1963 search results - page 153 / 393 » The Maximum Solution Problem on Graphs |
133
click to vote
LATIN
2010
Springer
15 years 9 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
118
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
125
click to vote
NETWORKING
2007
15 years 3 months ago
2007
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
103
Voted
ASPDAC
2004
ACM
15 years 6 months ago
2004
ACM
- Minimum area is one of the important objectives in technology mapping for lookup table-based FPGAs. It has been proven that the problem is NP-complete. This paper presents a poly...
123
Voted
WINE
2009
Springer
15 years 9 months ago
2009
Springer
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...