Sciweavers

Share
IACR
2011
130views more  IACR 2011»
7 years 9 months ago
Hiding the Policy in Cryptographic Access Control
Abstract. Recently, cryptographic access control has received a lot of attention, mainly due to the availability of efficient Attribute-Based Encryption (ABE) schemes. ABE allows ...
Sascha Müller, Stefan Katzenbeisser
NETWORKS
2011
8 years 7 days ago
On terminal delta-wye reducibility of planar graphs
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
Isidoro Gitler, Feliu Sagols
COMPGEOM
2011
ACM
8 years 29 days ago
Minors in random and expanding hypergraphs
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
Uli Wagner
CDC
2010
IEEE
172views Control Systems» more  CDC 2010»
8 years 1 months ago
Electrical centrality measures for electric power grid vulnerability analysis
— This paper investigates measures of centrality that are applicable to power grids. Centrality measures are used in network science to rank the relative importance of nodes and ...
Zhifang Wang, Anna Scaglione, Robert J. Thomas
MST
2010
187views more  MST 2010»
8 years 4 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
ICRA
2010
IEEE
185views Robotics» more  ICRA 2010»
8 years 8 months ago
Graph based distributed control of non-holonomic vehicles endowed with local positioning information engaged in escorting missio
— Using graph theory, this paper investigates how a group of robots, endowed with local positioning (range and bearing from other robots), can be engaged in a leaderfollowing mis...
Riccardo Falconi, Sven Gowal, Alcherio Martinoli
JCSC
1998
227views more  JCSC 1998»
8 years 9 months ago
Continuous and Hybrid Petri Nets
: Continuous and hybrid Petri nets can be seen as relaxation of discrete nets, in which the firing of some or of all transitions is approximated with a fluid model. Several analysi...
Hassane Alla, René David
SIAMDM
2008
190views more  SIAMDM 2008»
8 years 9 months ago
On the Complexity of Ordered Colorings
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
Arvind Gupta, Jan van den Heuvel, Ján Manuc...
GC
2007
Springer
8 years 9 months ago
An s -Hamiltonian Line Graph Problem
For an integer k > 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-cycles of G. In (J Graph Theory 11:399–407 (1987)), Broersma and Veldman propo...
Zhi-Hong Chen, Hong-Jian Lai, Wai-Chee Shiu, Deyin...
CORR
2007
Springer
177views Education» more  CORR 2007»
8 years 9 months ago
Another Proof of Wright's Inequalities
We present a short way of proving the inequalities obtained by Wright in [Journal of Graph Theory, 4: 393 – 407 (1980)] concerning the number of connected graphs with ℓ edges m...
Vlady Ravelomanana
books