Results 11  20
of
315
Efficient Algorithms for kDisjoint Paths Problems on DAGs
"... Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectives, MinMax, Balanced, MinSumMinMin, and MinSumMinMax. We use the algorithm by PerlShiloach and labelling and scaling ..."
Abstract
 Add to MetaCart
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectives, MinMax, Balanced, MinSumMinMin, and MinSumMinMax. We use the algorithm by PerlShiloach and labelling
Mining Edgedisjoint Patterns in Graphrelational Data
"... Diverse types of data are associated with proteins, including network and categorical data. While graph mining techniques have long focused on data with no more than one label per node, generalizations have recently been developed. We show that existing generalizations are not well suited to typical ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Diverse types of data are associated with proteins, including network and categorical data. While graph mining techniques have long focused on data with no more than one label per node, generalizations have recently been developed. We show that existing generalizations are not well suited
Disjoint LDPC Coding for Gaussian Broadcast Channels
, 906
"... Abstract—Lowdensity paritycheck (LDPC) codes have been used for communication over a twouser Gaussian broadcast channel. It has been shown in the literature that the optimal decoding of such system requires joint decoding of both user messages at each user. Also, a joint code design procedure sho ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
should be performed. We propose a method which uses a novel labeling strategy and is based on the idea behind the bitinterleaved coded modulation. This method does not require joint decoding and/or joint code optimization. Thus, it reduces the overall complexity of nearcapacity coding in broadcast
Map Labeling and Its Generalizations
"... Map labeling is of fundamental importance in cartography and geographical information systems and is one of the areas targeted for research by the ACM Computational Geometry Impact Task Force. Previous work on map labeling has focused on the problem of placing maximal uniform, axisaligned, disjoint ..."
Abstract

Cited by 41 (5 self)
 Add to MetaCart
aligned, disjoint rectangles on the plane so that each point feature to be labeled lies at the corner of one rectangle. Here, we consider a number of variants of the map labeling problem. We obtain three general types of results. First, we devise constantfactor polynomialtime approximation algorithms for labeling
Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration
, 2000
"... This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive onebyone with no a priori knowledge of future arrivals, and so necessitating use of online algorithms. Restorability implies that to successfull ..."
Abstract

Cited by 137 (2 self)
 Add to MetaCart
that to successfully route a path setup request both an active path and an alternate link (node) disjoint backup path have to be routed at the same time. This joint online routing problem is becoming particularly important in optical networks and in MPLS (Multi Protocol Label Switching) based networks due
Finding frequent patterns in a large sparse graph
 SIAM Data Mining Conference
, 2004
"... This paper presents two algorithms based on the horizontal and vertical pattern discovery paradigms that find the connected subgraphs that have a sufficient number of edgedisjoint embeddings in a single large undirected labeled sparse graph. These algorithms use three different methods to determine ..."
Abstract

Cited by 130 (4 self)
 Add to MetaCart
This paper presents two algorithms based on the horizontal and vertical pattern discovery paradigms that find the connected subgraphs that have a sufficient number of edgedisjoint embeddings in a single large undirected labeled sparse graph. These algorithms use three different methods
On edge graceful labelings of disjoint unions of 2rregular edge graceful graphs
, 2008
"... We prove that if G is a 2rregular edge graceful (p,q) graph with (r, kp) = 1 then kG is edge graceful for odd k. We also prove that for certain specific classes of 2rregular edge graceful graphs it is possible to drop the requirement that (r, kp) = 1 1 Introduction and ..."
Abstract
 Add to MetaCart
We prove that if G is a 2rregular edge graceful (p,q) graph with (r, kp) = 1 then kG is edge graceful for odd k. We also prove that for certain specific classes of 2rregular edge graceful graphs it is possible to drop the requirement that (r, kp) = 1 1 Introduction and
Total edge irregularity strength of the disjoint union of sun graphs
"... An edge irregular total klabeling ϕ: V ∪ E → {1, 2,..., k} of a graph G = (V,E) is a labeling of vertices and edges of G in such a way that for any different edges uv and u′v ′ their weights ϕ(u) +ϕ(uv) +ϕ(v) and ϕ(u′) +ϕ(u′v′) +ϕ(v′) are distinct. The total edge irregularity strength, tes(G), is d ..."
Abstract
 Add to MetaCart
(G), is defined as the minimum k for which G has an edge irregular total klabeling. In this paper, we consider the total edge irregularity strength of the disjoint union of p isomorphic sun graphs, tes(pMn), disjoint union of p consecutive nonisomorphic sun graphs, tes(⋃pj=1Mnj).
Evaluation of labeling strategies for rotating maps
 In Experimental Algorithms, volume 8504 of LNCS
, 2014
"... Abstract. We consider the following problem of labeling points in a dynamic map that allows rotation. We are given a set of points in the plane labeled by a set of mutually disjoint labels, where each label is an axisaligned rectangle attached with one corner to its respective point. We require tha ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We consider the following problem of labeling points in a dynamic map that allows rotation. We are given a set of points in the plane labeled by a set of mutually disjoint labels, where each label is an axisaligned rectangle attached with one corner to its respective point. We require
A novel watershed image segmentation technique using graceful labelling
 International Journal of Mathematics and Soft Computing Vol.3, No.1. (2013), 69 – 78
"... In this paper, we propose a novel watershed image segmentation technique based on absolute difference graph labeling. The main objective is to partition the image into distinct regions that are visually different, homogeneous and meaningful with respect to some characteristics or computed property, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
difference and then expands them to obtain complete absolute difference graph labeling. As a result, the image is portioned into a set of disjoint labels (regions).
Results 11  20
of
315