459 search results - page 32 / 92 » Detecting induced subgraphs |
TCS
2008
13 years 8 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
AAIM
2009
Springer
14 years 3 months ago
2009
Springer
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead o...
WG
2007
Springer
14 years 2 months ago
2007
Springer
A circular-arc model M = (C, A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has...
IADIS
2004
13 years 9 months ago
2004
The study on the topological structure of the Internet is very important for the simulation and the protocol design of the Internet. In recent years, some researchers have made pr...
IPL
2008
13 years 8 months ago
2008
A hub set in a graph G is a set U V (G) such that any two vertices outside U are connected by a path whose internal vertices lie in U. We prove that h(G) hc(G) c(G) h(G) + 1, ...