Sciweavers

378 search results - page 12 / 76
» How Many Ways Can One Draw a Graph
Sort
View
ECEASST
2008
60views more  ECEASST 2008»
13 years 8 months ago
Sufficient Criteria for Applicability and Non-Applicability of Rule Sequences
Abstract: In several rule-based applications using graph transformation as underlying modeling technique the following questions arise: How can one be sure that a specific sequence...
Leen Lambers, Hartmut Ehrig, Gabriele Taentzer
ECCC
2008
65views more  ECCC 2008»
13 years 8 months ago
A Lower Bound on the Size of Series-Parallel Graphs Dense in Long Paths
One way to quantify how dense a multidag is in long paths is to find the largest n, m such that whichever n edges are removed, there is still a path from an original input to an ...
Chris Calabro
COMGEO
2006
ACM
13 years 8 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
CSMR
2007
IEEE
14 years 2 months ago
Online Construction of Dynamic Object Process Graphs
A dynamic object process graph is a view on the control flow graph from the perspective of a single object. It has been shown that such a graph can be a useful starting point for...
Jochen Quante
AI
2009
Springer
14 years 3 months ago
Exploratory Analysis of Co-Change Graphs for Code Refactoring
Abstract. Version Control Systems (VCS) have always played an essential role for developing reliable software. Recently, many new ways of utilizing the information hidden in VCS ha...
Hassan Khosravi, Recep Colak