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 ...
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...
Jean Martinet, Iadh Ounis, Yves Chiaramella, Phili...
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...
—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...
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 ...