Sciweavers

990 search results - page 40 / 198
» Sub-Graphs of Complete Graph
Sort
View
CORR
2002
Springer
108views Education» more  CORR 2002»
13 years 7 months ago
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach all...
Matthew Dickerson, David Eppstein, Michael T. Good...
COMBINATORICA
2010
13 years 5 months ago
A randomized embedding algorithm for trees
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
Benny Sudakov, Jan Vondrák
TKDE
2012
250views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Dense Subgraph Extraction with Application to Community Detection
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
Jie Chen 0007, Yousef Saad
IJFCS
2006
111views more  IJFCS 2006»
13 years 7 months ago
Completeness and realizability: conditions for automatic generation of workflows
In recent years, workflow technology has greatly facilitated business process modeling and reengineering in information systems. On one hand, the separation of an application'...
Shiyong Lu, Arthur J. Bernstein, Philip M. Lewis
CALCO
2009
Springer
169views Mathematics» more  CALCO 2009»
14 years 2 months ago
Correctness, Completeness and Termination of Pattern-Based Model-to-Model Transformation
Abstract. Model-to-model (M2M) transformation consists in transforming models from a source to a target language. Many transformation languages exist, but few of them combine a dec...
Fernando Orejas, Esther Guerra, Juan de Lara, Hart...