Sciweavers

1736 search results - page 70 / 348
» On antimagic directed graphs
Sort
View
VLDB
2005
ACM
82views Database» more  VLDB 2005»
14 years 4 months ago
Stack-based Algorithms for Pattern Matching on DAGs
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...
Li Chen, Amarnath Gupta, M. Erdem Kurul
ASP
2003
Springer
14 years 3 months ago
Using Nested Logic Programs for Answer Set Programming
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
Thomas Linke
DM
2006
78views more  DM 2006»
13 years 10 months ago
On polynomial digraphs
Let (x, y) be a bivariate polynomial with complex coefficients. The zeroes of (x, y) are given a combinatorial structure by considering them as arcs of a directed graph G(). This p...
Josep M. Brunat, Antonio Montes
KDD
2009
ACM
200views Data Mining» more  KDD 2009»
14 years 5 months ago
Visual analysis of documents with semantic graphs
In this paper, we present a technique for visual analysis of documents based on the semantic representation of text in the form of a directed graph, referred to as semantic graph....
Delia Rusu, Blaz Fortuna, Dunja Mladenic, Marko Gr...
DM
2006
135views more  DM 2006»
13 years 10 months ago
Berge's conjecture on directed path partitions - a survey
Berge's conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilworth's Theorem and the Greene-Kleitman Theorem which are well known for pa...
Irith Ben-Arroyo Hartman