Sciweavers

678 search results - page 54 / 136
» Structural Properties of Sparse Graphs
Sort
View
COCOA
2010
Springer
13 years 3 months ago
Termination of Multipartite Graph Series Arising from Complex Network Modelling
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model...
Matthieu Latapy, Thi Ha Duong Phan, Christophe Cre...
DCG
2006
110views more  DCG 2006»
13 years 9 months ago
High-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension
Let A be a d by n matrix, d < n. Let C be the regular cross polytope (octahedron) in Rn . It has recently been shown that properties of the centrosymmetric polytope P = AC are ...
David L. Donoho
FCT
2009
Springer
14 years 22 days ago
Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
Thomas Thierauf, Fabian Wagner
CAAN
2004
Springer
14 years 2 months ago
Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces
We consider a generalized copy model of the web graph and related networks, and analyze its limiting behaviour. The model is motivated by previously proposed copying models of the ...
Anthony Bonato, Jeannette C. M. Janssen
ASP
2003
Springer
14 years 2 months ago
Suitable Graphs for Answer Set Programming
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
Thomas Linke