Sciweavers

852 search results - page 41 / 171
» Using graph parsing for automatic graph drawing
Sort
View
JCT
2007
111views more  JCT 2007»
15 years 1 months ago
Removing even crossings
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
GD
2009
Springer
15 years 6 months ago
Port Constraints in Hierarchical Layout of Data Flow Diagrams
Abstract. We present a new application for graph drawing in the context of graphical model-based system design, where manual placing of graphical items is still state-of-the-practi...
Miro Spönemann, Hauke Fuhrmann, Reinhard von ...
FMCO
2003
Springer
154views Formal Methods» more  FMCO 2003»
15 years 7 months ago
Tools for Generating and Analyzing Attack Graphs
Abstract. Attack graphs depict ways in which an adversary exploits system vulnerabilities to achieve a desired state. System administrators use attack graphs to determine how vulne...
Oleg Sheyner, Jeannette M. Wing
OWLED
2007
15 years 3 months ago
Use of OWL for Describing Stream Processing Components to Enable Automatic Composition
Stream Processing Applications analyze large volumes of streaming data in real-time. These applications, consist of data sources, which produce raw streams, and processing elements...
Zhen Liu, Anand Ranganathan, Anton Riabov
TAGT
1998
Springer
162views Graph Theory» more  TAGT 1998»
15 years 6 months ago
Hypergraphs as a Uniform Diagram Representation Model
When working with diagrams in visual environments like graphical diagram editors, diagrams have to be represented by an internal model. Graphs and hypergraphs are well-known concep...
Mark Minas