Sciweavers

1756 search results - page 111 / 352
» Directed scale-free graphs
Sort
View
MFCS
2007
Springer
14 years 2 months ago
Hardness Results for Tournament Isomorphism and Automorphism
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
Fabian Wagner
ISCAS
2005
IEEE
147views Hardware» more  ISCAS 2005»
14 years 1 months ago
A heuristic approach for multiple restricted multiplication
— This paper introduces a heuristic solution to the multiple restricted multiplication (MRM) optimization problem. MRM refers to a situation where a single variable is multiplied...
Nalin Sidahao, George A. Constantinides, Peter Y. ...
VLDB
2005
ACM
82views Database» more  VLDB 2005»
14 years 1 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 1 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
ICSM
1998
IEEE
14 years 9 days ago
Improving Visual Impact Analysis
Visual impact analysis is a software visualisation technique that lets software maintainers judge the impact of proposed changes and plan maintenance accordingly. An existing CASE...
Matthew A. Hutchins, Keith Gallagher