Sciweavers

5889 search results - page 429 / 1178
» Graph Layout Problems
Sort
View
DASFAA
2010
IEEE
169views Database» more  DASFAA 2010»
15 years 4 months ago
Fires on the Web: Towards Efficient Exploring Historical Web Graphs
Abstract. Discovery of evolving regions in large graphs is an important issue because it is the basis of many applications such as spam websites detection in the Web, community lif...
Zhenglu Yang, Jeffrey Xu Yu, Zheng Liu, Masaru Kit...
JAIR
2011
84views more  JAIR 2011»
15 years 1 months ago
Evaluating Temporal Graphs Built from Texts via Transitive Reduction
Temporal information has been the focus of recent attention in information extraction, leading to some standardization effort, in particular for the task of relating events in a t...
Xavier Tannier, Philippe Muller
STACS
2009
Springer
16 years 1 months ago
Approximating Acyclicity Parameters of Sparse Hypergraphs
The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello in order to extend the concept of hypergraph acyclicity. These noti...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
16 years 7 months ago
Quadratic forms on graphs
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
Noga Alon, Konstantin Makarychev, Yury Makarychev,...
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
15 years 10 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali