Results 1  10
of
1,027
ON FAIR EDGE DELETION PROBLEMS
, 2009
"... In edge deletion problems, we are given a graph G and a graph property π and the task is to find a subset of edges the deletion of which results in a subgraph of G satisfying the property π. Typically the objective is to minimize the total number of deleted edges while in less common fair versions t ..."
Abstract
 Add to MetaCart
In edge deletion problems, we are given a graph G and a graph property π and the task is to find a subset of edges the deletion of which results in a subgraph of G satisfying the property π. Typically the objective is to minimize the total number of deleted edges while in less common fair versions
Graphs equienergetic with edgedeleted subgraphs
, 2008
"... The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two graphs are equienergetic if they have the same energy. We construct infinite families of graphs equienergetic with edgedeleted subgraphs. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two graphs are equienergetic if they have the same energy. We construct infinite families of graphs equienergetic with edgedeleted subgraphs.
On Bayesian Network Approximation by Edge Deletion
 In UAI
, 2005
"... Abstract We consider the problem of deleting edges from a Bayesian network for the purpose of simplifying models in probabilistic inference. In particular, we propose a new method for deleting network edges, which is based on the evidence at hand. We provide some interesting bounds on the KLdiverg ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
Abstract We consider the problem of deleting edges from a Bayesian network for the purpose of simplifying models in probabilistic inference. In particular, we propose a new method for deleting network edges, which is based on the evidence at hand. We provide some interesting bounds on the KL
Additive approximation for edgedeletion problems
 Proc. of FOCS 2005
, 2005
"... A graph property is monotone if it is closed under removal of vertices and edges. In this paper we consider the following algorithmic problem, called the edgedeletion problem; given a monotone property P and a graph G, compute the smallest number of edge deletions that are needed in order to turn G ..."
Abstract

Cited by 19 (8 self)
 Add to MetaCart
A graph property is monotone if it is closed under removal of vertices and edges. In this paper we consider the following algorithmic problem, called the edgedeletion problem; given a monotone property P and a graph G, compute the smallest number of edge deletions that are needed in order to turn
Node and edgedeletion NPcomplete problems
 CONFERENCE RECORD OF THE TENTH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING (SAN DIEGO, CALIF., 1978), ACM
, 1978
"... If ~ is a graph property, the general node(edge) deletion problem can be stated as follows: Find the minimum number of nodes(edges), whose deletion results in a subgraph satisfying property ~. In this paper we show that if ~ belongs to a rather broad class of properties (the class of properties that ..."
Abstract

Cited by 95 (0 self)
 Add to MetaCart
If ~ is a graph property, the general node(edge) deletion problem can be stated as follows: Find the minimum number of nodes(edges), whose deletion results in a subgraph satisfying property ~. In this paper we show that if ~ belongs to a rather broad class of properties (the class of properties
Vertexdeleted and edgedeleted subgraphs
, 1992
"... Some classical problems in mathematics are of the following general type. If the structure S ′ is associated with each structure S, does S ′ determine S uniquely? In graph theory we ask what knowledge of the graph short of its full incidence relations is sufficient to determine the graph completely. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Some classical problems in mathematics are of the following general type. If the structure S ′ is associated with each structure S, does S ′ determine S uniquely? In graph theory we ask what knowledge of the graph short of its full incidence relations is sufficient to determine the graph completely. The structure S is a graph and S could
AN EDGE DELETION MODEL FOR COMPLEX NETWORKS
"... Abstract. We propose a new random graph model—Edge Popularity—for the web graph and other complex networks, where edges are deleted over time and an edge is chosen to be deleted with probability inversely proportional to the indegree of the destination. We show that with probability tending to one ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We propose a new random graph model—Edge Popularity—for the web graph and other complex networks, where edges are deleted over time and an edge is chosen to be deleted with probability inversely proportional to the indegree of the destination. We show that with probability tending to one
Chromaticity of Turan Graphs with At Most Three Edges Deleted
"... Abstract. Let P (G;) be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any graph H, P (H;) = P (G;) implies H is isomorphic to G. In this paper, we determine the chromaticity of all Turán graphs with at most three edges deleted. As a by product, we found many fami ..."
Abstract
 Add to MetaCart
Abstract. Let P (G;) be the chromatic polynomial of a graph G. A graph G is chromatically unique if for any graph H, P (H;) = P (G;) implies H is isomorphic to G. In this paper, we determine the chromaticity of all Turán graphs with at most three edges deleted. As a by product, we found many
Optimal Edge Deletions for Signed Graph Balancing
, 2007
"... The Balanced Subgraph problem (edge deletion variant) asks for a 2coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social networks, systems biology, and integrated circuit design. We present an exact algorithm for Balanced Subgraph based on a com ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
The Balanced Subgraph problem (edge deletion variant) asks for a 2coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social networks, systems biology, and integrated circuit design. We present an exact algorithm for Balanced Subgraph based on a
The Impact of Edge Deletions on the Number of Errors in Networks
"... In this paper, we deal with an error model in distributed networks. For a target t, every node is assumed to give an advice, ie.to point to a neighbour that take closer to the destination. Any node giving a bad advice is called a liar. Starting from a situation without any liar, we study the impact ..."
Abstract
 Add to MetaCart
the impact of topology changes on the number of liars. More precisely, we establish a relationship between the number of liars and the number of distance changes after one edge deletion. Whenever ℓ deleted edges are chosen uniformly at random, for any graph with n nodes, m edges and diameter D, we prove
Results 1  10
of
1,027