Sciweavers

2463 search results - page 309 / 493
» Rankings of Directed Graphs
Sort
View
130
Voted
ACSD
1998
IEEE
105views Hardware» more  ACSD 1998»
15 years 7 months ago
Visual Formalisms Revisited
The development of an interactive application is a complex task that has to consider data, behavior, intercommunication, architecture and distribution aspects of the modeled syste...
Radu Grosu, Gheorghe Stefanescu, Manfred Broy
133
Voted
ICSE
1999
IEEE-ACM
15 years 7 months ago
Data Flow Analysis for Checking Properties of Concurrent Java Programs
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...
Gleb Naumovich, George S. Avrunin, Lori A. Clarke
115
Voted
SWAT
1998
Springer
108views Algorithms» more  SWAT 1998»
15 years 7 months ago
Formal Language Constrained Path Problems
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 ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...
138
Voted
FCT
1993
Springer
15 years 7 months ago
Generalized Topological Sorting in Linear Time
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...
Torben Hagerup, Martin Maas
135
Voted
ESWS
2006
Springer
15 years 7 months ago
Semantic Network Analysis of Ontologies
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...
Bettina Hoser, Andreas Hotho, Robert Jäschke,...