Sciweavers

463 search results - page 18 / 93
» A General Framework for Graph Sparsification
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
Random Walks on Digraphs: A Theoretical Framework for Estimating Transmission Costs in Wireless Routing
—In this paper we develop a unified theoretical framework for estimating various transmission costs of packet forwarding in wireless networks. Our framework can be applied to th...
Yanhua Li, Zhi-Li Zhang
RE
2005
Springer
14 years 1 months ago
An Algebraic Framework for Merging Incomplete and Inconsistent Views
View merging, also called view integration, is a key problem in conceptual modeling. Large models are often constructed and accessed by manipulating individual views, but it is im...
Mehrdad Sabetzadeh, Steve M. Easterbrook
CAI
2007
Springer
14 years 1 months ago
From Algebraic Graph Transformation to Adhesive HLR Categories and Systems
In this paper, we present an overview of algebraic graph transformation in the double pushout approach. Basic results concerning independence, parallelism, concurrency, embedding, ...
Ulrike Prange, Hartmut Ehrig
CCS
2007
ACM
14 years 1 months ago
Toward measuring network security using attack graphs
In measuring the overall security of a network, a crucial issue is to correctly compose the measure of individual components. Incorrect compositions may lead to misleading results...
Lingyu Wang, Anoop Singhal, Sushil Jajodia
DM
2006
104views more  DM 2006»
13 years 7 months ago
Construction of trees and graphs with equal domination parameters
We provide a simple constructive characterization for trees with equal domination and independent domination numbers, and for trees with equal domination and total domination numb...
Michael Dorfling, Wayne Goddard, Michael A. Hennin...