Results 1  10
of
224
SublinearTime Parallel Algorithms for Matching and Related Problems
, 1988
"... This paper presents the first sublineartime deterministic parallel algorithms for bipartite matching and several related problems, including maximal nodedisjoint paths, depthfirst search, and flows in zeroone networks. Our results are based on a better understanding of the combinatorial struc ..."
Abstract

Cited by 36 (6 self)
 Add to MetaCart
This paper presents the first sublineartime deterministic parallel algorithms for bipartite matching and several related problems, including maximal nodedisjoint paths, depthfirst search, and flows in zeroone networks. Our results are based on a better understanding of the combinatorial
A New Parallel Algorithm For The Maximal Independent Set Problem
, 1989
"... A new parallel algorithm for the maximal independent set problem is constructed. It runs in O(log 4 n) time when implemented on a linear number of EREWprocessors. This is the first deterministic algorithm for the maximal independent set problem (MIS) whose running time is polylogarithmic and whose ..."
Abstract

Cited by 42 (2 self)
 Add to MetaCart
A new parallel algorithm for the maximal independent set problem is constructed. It runs in O(log 4 n) time when implemented on a linear number of EREWprocessors. This is the first deterministic algorithm for the maximal independent set problem (MIS) whose running time is polylogarithmic and whose
Parallel Algorithms for Maximal Linear Forests
 The Transactions of the IEICE
, 1997
"... . The maximal linear forest problem is to find, given a graph G = (V; E), a maximal subset of V that induces a linear forest. Three parallel algorithms for this problem are presented. The first one is randomized and runs in O(log n) expected time using n 2 processors on a CRCW PRAM. The second one ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
, graph algorithms, linear forests, maximal matchings, maximal independent sets. 1 Introduction Since Karp and Wigderson showed that the maximal independent set (MIS) problem is in the class NC [11], much work has been devoted to the study of parallel complexity of maximality problems. A typical
A SIMPLE PARALLEL ALGORITHM ,FOR THE MAXIMAL INDEPENDENT SET PROBLEM*
"... Abstract. Two basic design strategies are used to develop a very simple and fast parallel algorithms for the maximal independent set (MIS) problem. The first strategy consists of assigning identical copies of a simple algorithm to small local portions of the problem input. The algorithm is designed ..."
Abstract
 Add to MetaCart
Abstract. Two basic design strategies are used to develop a very simple and fast parallel algorithms for the maximal independent set (MIS) problem. The first strategy consists of assigning identical copies of a simple algorithm to small local portions of the problem input. The algorithm
Analysis of Parallel Algorithms for Finding A Maximal Independent Set in A Random Hypergraph
, 1996
"... It is well known [9] that finding a maximal independent set in a graph is in class NC, and [10] that finding a maximal independent set in a hypergraph with fixed dimension is in RNC. It is not known whether this latter problem remains in NC when the dimension is part of the input. We will study the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
the problem when the problem instances are randomly chosen. It was shown in [6] that the expected running time of a simple parallel algorithm for finding the lexicographically first maximal independent set (lfmis) in a random simple graph is logarithmic in the input size. In this paper, we will prove a
Theoretical Foundations of Equitability and the Maximal Information Coefficient
, 2014
"... The maximal information coefficient (MIC) is a tool for finding the strongest pairwise relationships in a data set with many variables [1]. MIC is useful because it gives similar scores to equally noisy relationships of different types. This property, called equitability, is important for analyzing ..."
Abstract
 Add to MetaCart
The maximal information coefficient (MIC) is a tool for finding the strongest pairwise relationships in a data set with many variables [1]. MIC is useful because it gives similar scores to equally noisy relationships of different types. This property, called equitability, is important for analyzing
Research Article Improved Algorithms OF CELF and CELF++ for Influence Maximization
, 2014
"... Motivated by the wide application in some fields, such as viral marketing, sales promotion etc, influence maximization has been the most important and extensively studied problem in social network. However, the most classical KKGreedy algorithm for influence maximization is inefficient. Two major s ..."
Abstract
 Add to MetaCart
degree and running time were employed to measure the performance and efficiency respectively. Experimental results showed that, compared with benchmark algorithms of CELF and CELF++, matching effects and higher efficiency were achieved by the new algorithms Lv_CELF and Lv_CELF++. Solutions
On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP
 In Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer ScienceVolume 00
, 2008
"... In this paper we consider the following maximum budgeted allocation(MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and with a maximum budget of Bi, the goal is to allocate items to agents to maximize revenue. The problem naturally arises as a ..."
Abstract

Cited by 34 (3 self)
 Add to MetaCart
as auctioneer revenue maximization in budgetconstrained auctions and as winner determination problem in combinatorial auctions when utilities of agents are budgetedadditive. Our main results are: • We give a 3/4approximation algorithm for MBA improving upon the previous best of ≃ 0.632[AM04, FV06]. Our
Pointset algorithms for pattern discovery and pattern matching in music
 In ContentBased Retrieval, Dagstuhl Seminar Proceedings
, 2006
"... Abstract. An algorithm that discovers the themes, motives and other perceptually significant repeated patterns in a musical work can be used, for example, in a music information retrieval system for indexing a collection of music documents so that it can be searched more rapidly. It can also be used ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
Euclidean space. This pointset pattern matching approach allows the maximal repeated patterns in a passage of polyphonic music to be discovered in quadratic time and all occurrences of these patterns to be found in cubic time. More recently, Clifford et al. [1] have shown that the best match for a query
Sketchbased influence maximization and computation: Scaling up with guarantees
 In International Conference on Information and Knowledge Management (ICIKM
, 2014
"... Propagation of contagion through networks is a fundamental process. It is used to model the spread of information, influence, or a viral infection. Diffusion patterns can be specified by a probabilistic model, such as Independent Cascade (IC), or captured by a set of representative traces. Basic co ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
computational problems in the study of diffusion are influence queries (determining the potency of a specified seed set of nodes) and Influence Maximization (identifying the most influential seed set of a given size). Answering each influence query involves many edge traversals, and does not scale when
Results 1  10
of
224