3008 search results - page 184 / 602 » Independence in connected graphs |
190
click to vote
JCT
2008
15 years 6 months ago
2008
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
160
click to vote
AAAI
2004
15 years 8 months ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
174
click to vote
FPGA
1998
ACM
15 years 10 months ago
1998
ACM
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
179
click to vote
ICDAR
2003
IEEE
15 years 11 months ago
2003
IEEE
A new system is presented for general symbol segmentation, which is applicable for segmentation of any connected string of symbols, including characters and line diagrams. Using a...
177
click to vote
IPCO
2010
15 years 8 months ago
2010
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...