Results 1  10
of
11
A Simple Approximation Algorithm for the Weighted Matching Problem
 Information Processing Letters
, 2003
"... We present a linear time approximation algorithm with a performance ratio of 1/2 for nding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [7]. ..."
Abstract

Cited by 28 (3 self)
 Add to MetaCart
We present a linear time approximation algorithm with a performance ratio of 1/2 for nding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [7].
A Linear Time Approximation Algorithm for Weighted Matchings in Graphs
, 2003
"... Approximation algorithms have so far mainly been studied for problems that are not known to have polynomial time algorithms for solving them exactly. Here we propose an approximation algorithm for the weighted matching problem in graphs which can be solved in polynomial time. The weighted matching p ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
Approximation algorithms have so far mainly been studied for problems that are not known to have polynomial time algorithms for solving them exactly. Here we propose an approximation algorithm for the weighted matching problem in graphs which can be solved in polynomial time. The weighted matching problem is to find a matching in an edge weighted graph that has maximum weight. The first polynomial time algorithm for this problem was given by Edmonds in 1965. The fastest known algorithm for the weighted matching problem has a running time of O(nm+n 2 log n). Many real world problems require graphs of such large size that this running time is too costly. Therefore there is considerable need for faster approximation algorithms for the weighted matching problem. We present a linear time approximation algorithm for the weighted matching problem with a performance ratio arbitrarily close to 2/3
A GraphTheoretic Network Security Game
 Proceedings of the First International Workshop on Internet and Network Economics
, 2005
"... Abstract. Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. We model this practical network scenario as a noncooperative multiplayer game on a graph, with two kinds of players, a set of attackers and a protect ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
Abstract. Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. We model this practical network scenario as a noncooperative multiplayer game on a graph, with two kinds of players, a set of attackers and a protector player, representing the viruses and the system security software, respectively. Each attacker player chooses a node of the graph (or a set of them, via a probability distribution) to infect. The protector player chooses independently, in a basic case of the problem, a simple path or an edge of the graph (or a set of them, via a probability distribution) and cleans this part of the network from attackers. Each attacker wishes to maximize the probability of escaping its cleaning by the protector. In contrast, the protector aims at maximizing the expected number of cleaned attackers. We call the two games obtained from the two basic cases considered, as the Path and the Edge model, respectively. We are interested in the associated Nash equilibria on them, where no
Linear Time Local Improvements for Weighted Matchings in Graphs
 IN INTERNATIONAL WORKSHOP ON EXPERIMENTAL AND ECIENT ALGORITHMS (WEA), LNCS 2647
, 2003
"... Recently two different linear time approximation algorithms for the weighted matching problem in graphs have been suggested [5][17]. Both these ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Recently two different linear time approximation algorithms for the weighted matching problem in graphs have been suggested [5][17]. Both these
Approximating weighted matchings in parallel
"... revised Version Abstract. We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 − ɛ). This improves the previously best approximation ratio of − ɛ) of an NC algorithm for this problem. ( 1 2 ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
revised Version Abstract. We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 − ɛ). This improves the previously best approximation ratio of − ɛ) of an NC algorithm for this problem. ( 1 2
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
 COVER NUMBER, ISAAC
, 2007
"... The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as KönigEgerváry graphs. KönigEgerváry graphs have been studied extensively from a graph theoretic point of view. In this paper, we introduce and study the algorithmic complexity of finding ma ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as KönigEgerváry graphs. KönigEgerváry graphs have been studied extensively from a graph theoretic point of view. In this paper, we introduce and study the algorithmic complexity of finding maximum KönigEgerváry subgraphs of a given graph. More specifically, we look at the problem of finding a minimum number of vertices or edges to delete to make the resulting graph KönigEgerváry. We show that both these versions are NPcomplete and study their complexity from the points of view of approximation and parameterized complexity. En route, we point out an interesting connection between the vertex deletion version and the Above Guarantee Vertex Cover problem where one is interested in the parameterized complexity of the Vertex Cover problem when parameterized by the ‘additional number of vertices ’ needed beyond the matching size. This connection is of independent interest and could be useful in establishing the parameterized complexity of Above Guarantee Vertex Cover problem.
Expander Graphs and Gaps between Primes
"... The explicit construction of infinite families of dregular graphs which are Ramanujan is known only in the case d−1 is a prime power. In this paper, we consider the case when d − 1 is not a prime power. The main result is that by perturbing known Ramanujan graphs and using results about gaps betwee ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The explicit construction of infinite families of dregular graphs which are Ramanujan is known only in the case d−1 is a prime power. In this paper, we consider the case when d − 1 is not a prime power. The main result is that by perturbing known Ramanujan graphs and using results about gaps between consecutive primes, we are able to construct infinite families of “almost ” Ramanujan graphs for almost every value of d. More precisely, for any fixed ǫ> 0 and for almost every value of d (in the sense of natural density), there are infinitely many dregular graphs such that all the nontrivial eigenvalues of the adjacency matrices of these graphs have absolute value less than (2 + ǫ) √ d − 1. 1
On Parallel Complexity of Maximum FMatching and the Degree Sequence Problem
, 1994
"... We present a randomized NC solution to the problem of constructing a maximum (cardinality) fmatching. As a corollary, we obtain a randomized NC algorithm for the problem of constructing a graph satisfying a sequence d 1 ; d 2 ;...; d n of equality degree constraints. We provide an optimal NC alg ..."
Abstract
 Add to MetaCart
We present a randomized NC solution to the problem of constructing a maximum (cardinality) fmatching. As a corollary, we obtain a randomized NC algorithm for the problem of constructing a graph satisfying a sequence d 1 ; d 2 ;...; d n of equality degree constraints. We provide an optimal NC algorithm for the decision version of the degree sequence problem and an approximation NC algorithm for the construction version of this problem. Our main result is an NC algorithm for constructing if possible a graph satisfying the degree constraints d 1 ; d 2 ;...; d n in case d i q P n j=1 d j =5 for i = 1; :::; n: 1 Introduction Finding a maximum (cardinality) matching in a graph is a fundamental problem in combinatorial optimization. It is a major open problem whether a maximum matching can be constructed by an NC algorithm. Achieving simultaneously a polylogtime and a polynomial number of processors is possible for this problem if random bits are used. Randomized NC algorithms ...
A Combinatoric Interpretation of Dual Variables for Weighted Matching Problems
, 2012
"... We consider four weighted matchingtype problems: the bipartite graph and general graph versions of matching and ffactors. The linear program duals for these problems are shown to be weights of certain subgraphs. Specifically the socalled y duals are the weights of certain maximum matchings or ff ..."
Abstract
 Add to MetaCart
We consider four weighted matchingtype problems: the bipartite graph and general graph versions of matching and ffactors. The linear program duals for these problems are shown to be weights of certain subgraphs. Specifically the socalled y duals are the weights of certain maximum matchings or ffactors; z duals (used for general graphs) are the weights of certain 2factors or 2ffactors. The y duals are canonical in a welldefined sense; z duals are canonical for matching and more generally for bmatchings (a special case of ffactors) but for ffactors their support can vary. As weights of combinatorial objects the duals are integral for given integral edge weights, and so they give new proofs that the linear programs for these problems are TDI. 1
Int. J. Autonomous and Adaptive Communications Systems, Vol. x, No. x, xx 1 A GraphTheoretic Network Security Game ∗
"... supported by the IST Program of the European Union under ..."