Sciweavers

1883 search results - page 69 / 377
» Ordered theta graphs
Sort
View
DM
2007
136views more  DM 2007»
13 years 7 months ago
Lower connectivities of regular graphs with small diameter
Krishnamoorthy, Thulasiraman and Swamy [Minimum order graphs with specified diameter, connectivity and regularity, Networks 19 (1989) 25–46] showed that a δ-regular graph with...
Camino Balbuena, Xavier Marcote
ENDM
2002
74views more  ENDM 2002»
13 years 7 months ago
Vertex Coverings by Coloured Induced Graphs - Frames and Umbrellas
A graph G homogeneously embeds in a graph H if for every vertex x of G and every vertex y of H there is an induced copy of G in H with x at y. The graph G uniformly embeds in H if...
Wayne Goddard, Michael A. Henning
RSA
2002
81views more  RSA 2002»
13 years 7 months ago
Decycling numbers of random regular graphs
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
Sheng Bau, Nicholas C. Wormald, Sanming Zhou
ICCS
2000
Springer
13 years 11 months ago
A Conceptual Graph Model for W3C Resource Description Framework
With the aim of building a "Semantic Web", the content of the documents must be explicitly represented through metadata in order to enable contents-guided search. Our app...
Olivier Corby, Rose Dieng, Cédric Hé...
CGA
2006
13 years 7 months ago
From Linear Story Generation to Branching Story Graphs
Interactive narrative systems are storytelling systems in which the user can influence the content or ordering of story world events. Conceptually, an interactive narrative can be...
Mark O. Riedl, R. Michael Young