1756 search results - page 205 / 352 » Directed scale-free graphs |
111
Voted
ICSE
1999
IEEE-ACM
15 years 5 months ago
1999
IEEE-ACM
In this paper we show how the FLAVERS data flow analysis technique, originally formulated for programs with the rendezvous model of concurrency, can be applied to concurrent Java...
90
Voted
SWAT
1998
Springer
15 years 5 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
122
Voted
FCT
1993
Springer
15 years 4 months ago
1993
Springer
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...
112
click to vote
ESWS
2006
Springer
15 years 4 months ago
2006
Springer
A key argument for modeling knowledge in ontologies is the easy re-use and re-engineering of the knowledge. However, beside consistency checking, current ontology engineering tools...
101
Voted
SBBD
2007
15 years 2 months ago
2007
In this work we propose a representation of the web as a directed hypergraph, instead of a graph, where links can connect not only pairs of pages, but also pairs of disjoint sets o...