796 search results - page 123 / 160 » The Anonymous Subgraph Problem |
210
click to vote
ACID
2006
15 years 3 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
96
Voted
DAM
2008
15 years 2 months ago
2008
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf po...
141
click to vote
TALG
2008
15 years 2 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
JGT
2007
15 years 2 months ago
2007
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
97
Voted
VLDB
2002
ACM
15 years 2 months ago
2002
ACM
The problem of indexing path queries in semistructured/XML databases has received considerable attention recently, and several proposals have advocated the use of structure indexe...