42 search results - page 5 / 9 » A New Algorithm for the Hypergraph Transversal Problem |
ICCAD
1996
IEEE
13 years 11 months ago
1996
IEEE
This paper presents a new spectral partitioning formulation which directly incorporates vertex size information. The new formulation results in a generalized eigenvalue problem, a...
MLG
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. There are many connections between graph mining and inductive logic programming (ILP), or more generally relational learning. Up till now these connections have mostly be...
LATIN
2004
Springer
14 years 25 days ago
2004
Springer
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...
DAM
2010
13 years 7 months ago
2010
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
In this paper, we present a new framework of video object
segmentation, in which we formulate the task of extracting
prominent objects from a scene as the problem of hypergraph
...