Sciweavers

5607 search results - page 222 / 1122
» Graph structure in the Web
Sort
View
FCT
2009
Springer
15 years 10 months 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
IPL
2007
101views more  IPL 2007»
15 years 6 months ago
Adjacency queries in dynamic sparse graphs
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
Lukasz Kowalik
HT
2010
ACM
15 years 8 months ago
Analysis of graphs for digital preservation suitability
We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...
Charles L. Cartledge, Michael L. Nelson
EDBT
2011
ACM
197views Database» more  EDBT 2011»
14 years 10 months ago
Symmetrizations for clustering directed graphs
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
Venu Satuluri, Srinivasan Parthasarathy
KES
2004
Springer
15 years 12 months ago
Intelligent Web Site: Understanding the Visitor Behavior
Abstract. Intelligent web site is a new portal generation, able to improve its structure and content based on the analysis of the user behavior. This paper focuses on modeling the ...
Juan D. Velásquez, Pablo A. Estévez,...