2125 search results - page 101 / 425 » On Graph Complexity |
EJC
2007
13 years 10 months ago
2007
The cone ˆG of a finite graph G is obtained by adding a new vertex p, called the cone point, and joining each vertex of G to p by a simple edge. We show that the rank of the red...
DAM
2006
13 years 10 months ago
2006
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
STOC
2003
ACM
14 years 10 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
This paper presents a novel graph cut based segmentation approach with shape priors. The model incorporates statistical shape prior information with the active contour without edg...