Sciweavers

2283 search results - page 180 / 457
» Bounds of Graph Characteristics
Sort
View
COMPGEOM
2009
ACM
14 years 2 months ago
Minimum cuts and shortest homologous cycles
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
ESWS
2008
Springer
13 years 10 months ago
dRDF: Entailment for Domain-Restricted RDF
Abstract. We introduce domain-restricted RDF (dRDF) which allows to associate an RDF graph with a fixed, finite domain that interpretations for it may range over. We show that dRDF...
Reinhard Pichler, Axel Polleres, Fang Wei, Stefan ...
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
13 years 6 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
CORR
2012
Springer
230views Education» more  CORR 2012»
12 years 4 months ago
Fast Triangle Counting through Wedge Sampling
Graphs and networks are used to model interactions in a variety of contexts, and there is a growing need to be able to quickly assess the qualities of a graph in order to understa...
C. Seshadhri, Ali Pinar, Tamara G. Kolda
IAT
2006
IEEE
14 years 2 months ago
A Labeled Graph Approach to Analyze Organizational Performance
Determining the performance of an organization is a must for both human and multi-agent organizations. The performance analysis enables organizations to uncover unexpected propert...
Mark Hoogendoorn, Jan Treur, Pinar Yolum