Results 11  20
of
239
The Maximum Edge Biclique Problem is NPcomplete.
 Discr. Appl. Math.
, 2003
"... Abstract We prove that the maximum edge biclique problem in bipartite graphs is NPcomplete. ? ..."
Abstract

Cited by 116 (0 self)
 Add to MetaCart
(Show Context)
Abstract We prove that the maximum edge biclique problem in bipartite graphs is NPcomplete. ?
Automatic graph drawing and readability of diagrams
 IEEE Transactions on Systems, Man and Cybernetics
, 1988
"... ..."
Propositional Circumscription and Extended Closed World Reasoning are $\Pi^P_2$complete
 Theoretical Computer Science
, 1993
"... Circumscription and the closed world assumption with its variants are wellknown nonmonotonic techniques for reasoning with incomplete knowledge. Their complexity in the propositional case has been studied in detail for fragments of propositional logic. One open problem is whether the deduction prob ..."
Abstract

Cited by 108 (20 self)
 Add to MetaCart
(Show Context)
Circumscription and the closed world assumption with its variants are wellknown nonmonotonic techniques for reasoning with incomplete knowledge. Their complexity in the propositional case has been studied in detail for fragments of propositional logic. One open problem is whether the deduction problem for arbitrary propositional theories under the extended closed world assumption or under circumscription is $\Pi^P_2$complete, i.e., complete for a class of the second level of the polynomial hierarchy. We answer this question by proving these problems $\Pi^P_2$complete, and we show how this result applies to other variants of closed world reasoning.
Biconnectivity Approximations and Graph Carvings
, 1994
"... A spanning tree in a graph is the smallest connected spanning subgraph. Given a graph, how does one find the smallest (i.e., least number of edges) 2connected spanning subgraph (connectivity refers to both edge and vertex connectivity, if not specified) ? Unfortunately, the problem is known to be ..."
Abstract

Cited by 93 (4 self)
 Add to MetaCart
A spanning tree in a graph is the smallest connected spanning subgraph. Given a graph, how does one find the smallest (i.e., least number of edges) 2connected spanning subgraph (connectivity refers to both edge and vertex connectivity, if not specified) ? Unfortunately, the problem is known to be NP hard. We consider the problem of finding a better approximation to the smallest 2connected subgraph, by an efficient algorithm. For 2edge connectivity our algorithm guarantees a solution that is no more than 3 2 times the optimal. For 2vertex connectivity our algorithm guarantees a solution that is no more than 5 3 times the optimal. The previous best approximation factor is 2 for each of these problems. The new algorithms (and their analyses) depend upon a structure called a carving of a graph, which is of independent interest. We show that approximating the optimal solution to within an additive constant is NP hard as well. We also consider the case where the graph has edge weigh...
Harmonic Analysis of polynomial threshold functions
 SIAM Journal of Discrete Mathematics
, 1990
"... Abstract. The analysis of linear threshold Boolean functions has recently attracted the attention ofthose interested in circuit complexity as well as ofthose interested in neural networks. Here a generalization oflinear threshold functions is defined, namely, polynomial threshold functions, and its ..."
Abstract

Cited by 92 (2 self)
 Add to MetaCart
Abstract. The analysis of linear threshold Boolean functions has recently attracted the attention ofthose interested in circuit complexity as well as ofthose interested in neural networks. Here a generalization oflinear threshold functions is defined, namely, polynomial threshold functions, and its relation to the class of linear threshold functions is investigated. A Boolean function is polynomial threshold if it can be represented as a sign function ofapolynomial that consists ofa polynomial (in the number ofvariables)number ofterms. Themain result ofthis paper is showing that the class ofpolynomial threshold functions(which is calledPT1 is strictly contained in the class ofBoolean functions that can be computed by a depth 2, unbounded fanin polynomial size circuit of linear threshold gates (which is calledLT2). Harmonic analysis ofBoolean functions is used to derive a necessaryand sufficient condition forafunction to be an Sthreshold function for a given setS ofmonomials. This condition is used to show that the number of different Sthreshold functions, for a given S, is at most 2 t’ / 1)lsl. Based on the necessary and sufficient condition, a lower bound is derived on the number of terms in a threshold function. The lower bound is expressed in terms of the spectral representation of a Boolean function. It is found that Boolean functions having an exponentially small spectrum are not polynomial threshold. A family of functions is exhibited that has an exponentially small spectrum; they are called &quot;semibent &quot; functions. A function is constructed that is both semibent and symmetric to prove thatPT is properly contained in LT2. Key words, bent functions, Boolean functions, circuit complexity, harmonic analysis, lower bounds, threshold functions where and 1. Introduction. A Boolean functionf(X
Approximating the minimumdegree Steiner tree to within one of optimal
 JOURNAL OF ALGORITHMS
, 1994
"... ... some optimal tree for the respective problems. Unless P = N P, this is the best bound achievable in polynomial time. ..."
Abstract

Cited by 84 (4 self)
 Add to MetaCart
... some optimal tree for the respective problems. Unless P = N P, this is the best bound achievable in polynomial time.
Models and Approximation Algorithms for Channel Assignment in Radio Networks
, 2000
"... We consider the frequency assignment (broadcast scheduling) problem for packet radio networks. Such networks are naturally modeled by graphs with a certain geometric structure. The problem of broadcast scheduling can be cast as a variant of the vertex coloring problem (called the distance2 coloring ..."
Abstract

Cited by 84 (3 self)
 Add to MetaCart
(Show Context)
We consider the frequency assignment (broadcast scheduling) problem for packet radio networks. Such networks are naturally modeled by graphs with a certain geometric structure. The problem of broadcast scheduling can be cast as a variant of the vertex coloring problem (called the distance2 coloring problem) on the graph that models a given packet radio network. We present efficient approximation algorithms for the distance2 coloring problem for various geometric graphs including those that naturally model a large class of packet radio networks. The class of graphs considered include (r, s)civilized graphs, planar graphs, graphs with bounded genus, etc.
Moore graphs and beyond: A survey of the degree/diameter problem
 ELECTRONIC JOURNAL OF COMBINATORICS
, 2013
"... The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree and given diameter. General upper bounds – called Moore bounds – for the order of such graphs and digraphs are attainable only for certain special graphs and digraphs. Finding better (tighter) upper bo ..."
Abstract

Cited by 67 (7 self)
 Add to MetaCart
(Show Context)
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree and given diameter. General upper bounds – called Moore bounds – for the order of such graphs and digraphs are attainable only for certain special graphs and digraphs. Finding better (tighter) upper bounds for the maximum possible number of vertices, given the other two parameters, and thus attacking the degree/diameter problem ‘from above’, remains a largely unexplored area. Constructions producing large graphs and digraphs of given degree and diameter represent a way of attacking the degree/diameter problem ‘from below’. This survey aims to give an overview of the current stateoftheart of the degree/diameter problem. We focus mainly on the above two streams of research. However, we could not resist mentioning also results on various related problems. These include considering Moorelike bounds for special types of graphs and digraphs, such as vertextransitive, Cayley, planar, bipartite, and many others, on