Sciweavers

106 search results - page 11 / 22
» Dominating direct products of graphs
Sort
View
ISAAC
2005
Springer
118views Algorithms» more  ISAAC 2005»
14 years 26 days ago
External Data Structures for Shortest Path Queries on Planar Digraphs
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
Lars Arge, Laura Toma
EJC
2011
13 years 2 months ago
Distributive lattices, polyhedra, and generalized flows
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
Stefan Felsner, Kolja B. Knauer
PKDD
2009
Springer
129views Data Mining» more  PKDD 2009»
14 years 1 months ago
RTG: A Recursive Realistic Graph Generator Using Random Typing
We propose a new, recursive model to generate realistic graphs, evolving over time. Our model has the following properties: it is (a) flexible, capable of generating the cross pro...
Leman Akoglu, Christos Faloutsos
GG
2004
Springer
14 years 22 days ago
Model Checking Graph Transformations: A Comparison of Two Approaches
Model checking is increasingly popular for hardware and, more recently, software verification. In this paper we describe two different approaches to extend the benefits of model ...
Arend Rensink, Ákos Schmidt, Dániel ...
ESWA
2008
166views more  ESWA 2008»
13 years 6 months ago
Modular design to support green life-cycle engineering
The severe competition in the market has driven enterprises to produce a wider variety of products to meet consumers' needs. However, frequent variation of product specificat...
Hwai-En Tseng, Chien-Chen Chang, Jia-Diann Li