Sciweavers

1736 search results - page 127 / 348
» On antimagic directed graphs
Sort
View
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
16 years 7 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
16 years 7 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
16 years 3 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
CIKM
2007
Springer
16 years 21 days ago
RDF data exploration and visualization
We present Paged Graph Visualization (PGV), a new semiautonomous tool for RDF data exploration and visualization. PGV consists of two main components: a) the “PGV explorer” an...
Leonidas Deligiannidis, Krys Kochut, Amit P. Sheth
HICSS
1995
IEEE
82views Biometrics» more  HICSS 1995»
15 years 10 months ago
A graph-theoretic data model for genome mapping databases
Graphs are a natural foundation for genome map databases. Mapping and other genomic data can be clearly represented by graphs, and graphs can be stored in a database. Graphs are d...
Mark Graves, Ellen R. Bergeman, Charles B. Lawrenc...