1756 search results - page 13 / 352 » Directed scale-free graphs |
GBRPR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an efficient generation of the common connecte...
ARSCOM
2006
13 years 7 months ago
2006
Let Za
WG
2007
Springer
14 years 1 months ago
2007
Springer
Kelly-width is a parameter of directed graphs recently proposed by Hunter and Kreutzer as a directed analogue of treewidth. We give several alternative characterizations of direct...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...