Sciweavers

3105 search results - page 128 / 621
» The Path-Packing Structure of Graphs
Sort
View
IPL
2006
72views more  IPL 2006»
15 years 3 months ago
Structure and linear time recognition of 3-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k...
Andreas Brandstädt, Van Bang Le
ZEUS
2010
180views Communications» more  ZEUS 2010»
15 years 4 months ago
An efficient approach to detect lack of synchronization in acyclic workflow graphs
Control-flow analysis of business process models requires to check the absence of lack of synchronization. We use workflow graphs, which may contain inclusive OR gateways, to repre...
Cédric Favre
89
Voted
SODA
2003
ACM
139views Algorithms» more  SODA 2003»
15 years 4 months ago
Compact representations of separable graphs
We consider the problem of representing graphs compactly while supporting queries efficiently. In particular we describe a data structure for representing n-vertex unlabeled graph...
Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash
130
Voted
IJWGS
2006
125views more  IJWGS 2006»
15 years 3 months ago
Compiling business processes: untangling unstructured loops in irreducible flow graphs
: This paper presents a systematic study of some major problems involved in the transformation of business process modelling languages to executable business process representation...
Wei Zhao, Rainer Hauser, Kamal Bhattacharya, Barre...
137
Voted
ACSC
2004
IEEE
15 years 7 months ago
Flexible Layering in Hierarchical Drawings with Nodes of Arbitrary Size
Graph drawing is an important area of information visualization which concerns itself with the visualization of relational data structures. Relational data like networks, hierarch...
Carsten Friedrich, Falk Schreiber