Results 11  20
of
35
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover
"... The "Constraint Bipartite Vertex Cover" problem (CBVC for short) is: given a bipartite graph G with n vertices and two positive integers k 1 ; k 2 , is there a vertex cover taking at most k 1 vertices from one and at most k 2 vertices from the other vertex set of G? CBVC is NPcomplete. It ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
The "Constraint Bipartite Vertex Cover" problem (CBVC for short) is: given a bipartite graph G with n vertices and two positive integers k 1 ; k 2 , is there a vertex cover taking at most k 1 vertices from one and at most k 2 vertices from the other vertex set of G? CBVC is NPcomplete. It formalizes the spare allocation problem for reconfigurable arrays, an important problem from VLSI manufacturing.
Distributed Sparse Gaussian Elimination And Orthogonal Factorization
 LAPACK WORKING NOTE 64 (UT CS93203)
, 1993
"... We consider the solution of a linear system Ax = b on a distributed memory machine when the matrix A has full rank and is large, sparse and nonsymmetric. We use our Cartesian nested dissection algorithm to compute a fillreducing column ordering of the matrix. We develop algorithms that use the asso ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
We consider the solution of a linear system Ax = b on a distributed memory machine when the matrix A has full rank and is large, sparse and nonsymmetric. We use our Cartesian nested dissection algorithm to compute a fillreducing column ordering of the matrix. We develop algorithms that use the associated separator tree to estimate the structure of the factor and to distribute and perform numeric computations. When the matrix is nonsymmetric but square, the numeric computations involve Gaussian elimination with row pivoting; when the matrix is overdetermined, roworiented Householder transforms are applied to compute the triangular factor of an orthogonal factorization. We compare the fill incurred by our approach to that incurred by well known sequential methods and report on the performance of our implementation on the Intel iPSC/860.
NPHardness of the Stable Matrix in Unit Interval Family Problem in Discrete Time
 Systems and Control Letters
, 2001
"... We show that to determine if a family of matrices, each with parameters in the unit interval, contains a matrix with all eigenvalues inside the unit circle is an NPhard problem. We also discuss how this problem is closely related to the widespread problem of power control in wireless systems. keywo ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
We show that to determine if a family of matrices, each with parameters in the unit interval, contains a matrix with all eigenvalues inside the unit circle is an NPhard problem. We also discuss how this problem is closely related to the widespread problem of power control in wireless systems. keywords: Complexity, NPhardness. 1 1
RealTime Properties of Indirect Recursive Porcedures
, 1996
"... The purpose of this paper is to show that indirect recursive procedures can be used for implementing realtime applications without harm, if a few conditions are met. These conditions ensure that upper bounds for space and time requirements can be derived at compile time. Moreover they are simpl ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
The purpose of this paper is to show that indirect recursive procedures can be used for implementing realtime applications without harm, if a few conditions are met. These conditions ensure that upper bounds for space and time requirements can be derived at compile time. Moreover they are simple enough such that many important recursive algorithms can be implemented. In addition
Some Prospects for Efficient Fixed Parameter Algorithms
 In Proc. of the 25th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM’98), Springer, LNCS 1521
, 1998
"... Recent time has seen quite some progress in the development of exponential time algorithms for NPhard problems, where the base of the exponential term is fairly small. These developments are also tightly related to the theory of fixed parameter tractability. In this incomplete survey, we explain so ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Recent time has seen quite some progress in the development of exponential time algorithms for NPhard problems, where the base of the exponential term is fairly small. These developments are also tightly related to the theory of fixed parameter tractability. In this incomplete survey, we explain some basic techniques in the design of efficient fixed parameter algorithms, discuss deficiencies of parameterized complexity theory, and try to point out some future research challenges. The focus of this paper is on the design of efficient algorithms and not on a structural theory of parameterized complexity. Moreover, our emphasis will be laid on two exemplifying issues: Vertex Cover and MaxSat problems. A shorter version of this paper appears as an invited talk in the proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'98), Springer, LNCS , held in Jasna, Slovakia, November 2127, 1998. y Supported by a Feodor Lynen fellowship of the Alex...
Structural pattern matching of nonribosomal peptides
 in "BMC Structural Biology", March 18 2009, vol. 9:15 [DOI
"... ..."
A linear time algorithm for finding a maximal planar subgraph based on PCtrees
 of Lecture Notes in Computer Science
, 2005
"... ABSTRACT. Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of GH can be added to H without destroying planarity. Polynomial algorithms have been obtained by Jakayumar, Thulasiraman and Swamy [6] and Wu [9]. O(mlogn) algorith ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
ABSTRACT. Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of GH can be added to H without destroying planarity. Polynomial algorithms have been obtained by Jakayumar, Thulasiraman and Swamy [6] and Wu [9]. O(mlogn) algorithms were previously given by Di Battista and Tamassia [3] and Cai, Han and Tarjan [2]. A recent O(mα (n)) algorithm was obtained by La Poute [7]. Our algorithm is based on a simple planarity test [5] developed by the author, which is a vertex addition algorithm based on a depthfirstsearch ordering. The planarity test [5] uses no complicated data structure and is conceptually simpler than Hopcroft and Tarjan's path addition and Lempel, Even and Cederbaum's vertex addition approaches. 1 1.
UserDriven Adaption in RuleBased Pattern Recognition
, 2004
"... Today, in software intensive projects a huge amount of the budget flows into the analysis of the already existing system. The reason for the high costs results mainly from the fact that analyses are often made manually or with automatic tool support, which is inappropriate for analyzing large system ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Today, in software intensive projects a huge amount of the budget flows into the analysis of the already existing system. The reason for the high costs results mainly from the fact that analyses are often made manually or with automatic tool support, which is inappropriate for analyzing large systems. Semiautomatic analysis approaches usually use a notion of fuzziness to overcome this limitation, but inherit the problem of selecting appropriate initial values. In this paper we present an approach to adapt the initial values of our semiautomatic reverse engineering process. We provide the reverse engineer with accuracy information for results produced by a rulebased inference algorithm. Based on the changes of the results done by the reverse engineer we automatically adapt a credibility value of each rule, which previously has been used to compute the accuracy of the result. The adaption fits seamlessly into our overall analysis process. First tests show that it is suitable for the calibration of our fuzzyfied rulebased pattern recognition approach. 1.
OnLine Graphics Recognition: StateoftheArt
 in GREC 2003: 5th IAPR International Workshop on Graphics Recognition, 2003
, 2003
"... A brief survey on online graphics recognition is presented. We first present some common scenarios and applications of online graphics recognition and then identify major problems and subproblems at three levels: primitive shape recognition, composite graphic object recognition, and document ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
A brief survey on online graphics recognition is presented. We first present some common scenarios and applications of online graphics recognition and then identify major problems and subproblems at three levels: primitive shape recognition, composite graphic object recognition, and document recognition and understanding. Representative approaches to these problems are also presented. We also list several open problems at the end.
Maintenance of 2 and 3Connected Components of Graphs, Part I: 2 and 3EdgeConnected Components
, 1990
"... In this paper a data structure is presented to efficiently maintain the 2and 3edgeconnected components of a graph, under insertions of edges in the graph. Starting from an "empty" graph of n nodes, the insertion of e edges takes O(nlogn[ e) time in total. The data structure allows f ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this paper a data structure is presented to efficiently maintain the 2and 3edgeconnected components of a graph, under insertions of edges in the graph. Starting from an "empty" graph of n nodes, the insertion of e edges takes O(nlogn[ e) time in total. The data structure allows for insertions of nodes also (in the same time bounds, taking n as the final number of nodes).