Sciweavers

208 search results - page 9 / 42
» The diameter of protean graphs
Sort
View
WAW
2007
Springer
162views Algorithms» more  WAW 2007»
14 years 1 months ago
Random Dot Product Graph Models for Social Networks
Inspired by the recent interest in combining geometry with random graph models, we explore in this paper two generalizations of the random dot product graph model proposed by Kraet...
Stephen J. Young, Edward R. Scheinerman
MFCS
2009
Springer
14 years 1 months ago
FO Model Checking on Nested Pushdown Trees
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable µ-c...
Alexander Kartzow
IPL
2007
96views more  IPL 2007»
13 years 7 months ago
Fault diameter of product graphs
The (k − 1)-fault diameter Dk(G) of a k-connected graph G is the maximum diameter of an induced subgraph by deleting at most k − 1 vertices from G. This paper considers the fa...
Jun-Ming Xu, Chao Yang
ALGORITHMICA
2004
130views more  ALGORITHMICA 2004»
13 years 7 months ago
Diameter and Treewidth in Minor-Closed Graph Families, Revisited
Eppstein [5] characterized the minor-closed graph families for which the treewidth is bounded by a function of the diameter, which includes e.g. planar graphs. This characterizatio...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
IPPS
1999
IEEE
13 years 11 months ago
A new Architecture for Multihop Optical Networks
Multihop lightwave networks are becoming increasingly popular in optical networks. It is attractive to consider regular graphs as the logical topology for a multihop network, due t...
Arunita Jaekel, Subir Bandyopadhyay, Abhijit Sengu...