175 search results - page 7 / 35 » max-cut and Containment Relations in Graphs |
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...
ECIR
2003
Springer
13 years 10 months ago
2003
Springer
We present in this paper a relational approach for indexing and retrieving photographs from a collection. Instead of using simple keywords as an indexing language, we propose to u...
DM
2008
13 years 8 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...
ASUNAM
2011
IEEE
12 years 8 months ago
2011
IEEE
—Bibliographic databases are a prosperous field for data mining research and social network analysis. They contain rich information, which can be analyzed across different dimen...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central ...