64 search results - page 2 / 13 » Algorithms for Secretary Problems on Graphs and Hypergraphs |
155
Voted
IPCO
2010
15 years 6 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...
156
click to vote
CVPR
2005
IEEE
16 years 7 months ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
133
click to vote
ISCAS
1994
IEEE
15 years 9 months ago
1994
IEEE
In layout design nding e ciently good solutions to the hypergraph bipartitioning problem is of great importance. This paper introduces a new algorithm, the dynamic locking algorit...
165
Voted
SIAMDM
2010
15 years 2 days ago
2010
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
142
Voted
WG
2005
Springer
15 years 10 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...