990 search results - page 9 / 198 » Sub-Graphs of Complete Graph |
COLOGNETWENTE
2010
13 years 4 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
ICASSP
2010
IEEE
13 years 6 months ago
2010
IEEE
Bone mineral density (BMD) measurements and fracture analysis of the spine bones are restricted to the Vertebral bodies (VBs), especially the trabecular bones (TBs). In this paper...
CPC
2011
13 years 2 months ago
2011
Consider a randomly oriented graph G = (V, E) and let a, s and b be three distinct vertices in V . We study the correlation between the events {a → s} and {s → b}. We show that...
CPC
2010
13 years 4 months ago
2010
A string graph is the intersection graph of a collection of continuous arcs in the plane. It is shown that any string graph with m edges can be separated into two parts of roughly...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...