IACR
2011
13 years 2 days ago
2011
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 ...
NETWORKS
2011
13 years 3 months ago
2011
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...
COMPGEOM
2011
ACM
13 years 4 months ago
2011
ACM
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...
CDC
2010
IEEE
13 years 4 months ago
2010
IEEE
— 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 ...
MST
2010
13 years 7 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
ICRA
2010
IEEE
13 years 11 months ago
2010
IEEE
— 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...
JCSC
1998
14 years 2 days ago
1998
: 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...
SIAMDM
2008
14 years 10 days ago
2008
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...
GC
2007
Springer
14 years 11 days ago
2007
Springer
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...
CORR
2007
Springer
14 years 12 days ago
2007
Springer
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...