1736 search results - page 58 / 348 » On antimagic directed graphs |
ESA
2011
Springer
12 years 10 months ago
2011
Springer
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
ICALP
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is aske...
WMCSA
2002
IEEE
14 years 3 months ago
2002
IEEE
Many “ubiquitous computing” applications need a constant flow of information about their environment to be able to adapt to their changing context. To support these “contex...
NETWORK
2010
13 years 5 months ago
2010
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...