Results 1  10
of
24
Certifying LexBFS recognition algorithms for proper inteval graphs and proper interval bigraphs
 SIAM J. Discrete Math
"... Recently, D. Corneil found a simple 3sweep lexicographic breadth first search (LexBFS) algorithm for the recognition of proper interval graphs. We point out how to modify Corneil’s algorithm to make it a certifying algorithm, and then describe a similar certifying 3sweep LexBFS algorithm for the r ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
Recently, D. Corneil found a simple 3sweep lexicographic breadth first search (LexBFS) algorithm for the recognition of proper interval graphs. We point out how to modify Corneil’s algorithm to make it a certifying algorithm, and then describe a similar certifying 3sweep LexBFS algorithm for the recognition of proper interval bigraphs. It follows from an earlier paper that the class of proper interval bigraphs is equal to the better known class of bipartite permutation graphs, and so we have a certifying algorithm for that class as well. All our algorithms run in time O(m + n), including the certification phase. The certificates of representability (the intervals) can be authenticated in time O(m + n), the certificates of nonrepresentability (the forbidden subgraphs) can be authenticated in time O(n). 1
A Finegrained Analysis of a Simple Independent Set Algorithm
 LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS
, 2009
"... We present a simple exact algorithm for the INDEPENDENT SET problem with a runtime bounded by O(1.2132 npoly(n)). This bound is obtained by, firstly, applying a new branching rule and, secondly, by a distinct, computeraided case analysis. The new branching rule uses the concept of satellites and ha ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
We present a simple exact algorithm for the INDEPENDENT SET problem with a runtime bounded by O(1.2132 npoly(n)). This bound is obtained by, firstly, applying a new branching rule and, secondly, by a distinct, computeraided case analysis. The new branching rule uses the concept of satellites and has previously only been used in an algorithm for sparse graphs. The computeraided case analysis allows us to capture the behavior of our algorithm in more detail than in a traditional analysis. The main purpose of this paper is to demonstrate how a very simple algorithm can outperform more complicated ones if the right analysis of its running time is performed.
Approximation and FixedParameter Algorithms for Consecutive Ones Submatrix Problems
 JOURNAL OF COMPUTER AND SYSTEM SCIENCES
"... We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1matrices fulfilling the Consecutive Ones Property (C1P). This characterization finds applications in new polynomialtime approximation algorithms and fixedparameter tractability results for the NPhard ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1matrices fulfilling the Consecutive Ones Property (C1P). This characterization finds applications in new polynomialtime approximation algorithms and fixedparameter tractability results for the NPhard problem to delete a minimum number of rows or columns from a 0/1matrix such that the remaining submatrix has the C1P.
A simple 3sweep LBFS algorithm for the recognition of unit interval graphs
 DISCRETE APPLIED MATHEMATICS
, 2003
"... ..."
Interval completion with few edges
 In STOC’07—Proceedings of the 39th Annual ACM Symposium on Theory of Computing
, 2007
"... We present an algorithm with runtime O(k 2k n 3 m) for the following NPcomplete problem [8, problem GT35]: Given an arbitrary graph G on n vertices and m edges, can we obtain an interval graph by adding at most k new edges to G? This resolves the longstanding open question [17, 6, 24, 13], first p ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
We present an algorithm with runtime O(k 2k n 3 m) for the following NPcomplete problem [8, problem GT35]: Given an arbitrary graph G on n vertices and m edges, can we obtain an interval graph by adding at most k new edges to G? This resolves the longstanding open question [17, 6, 24, 13], first posed by Kaplan, Shamir and Tarjan, of whether this problem could be solved in time f(k) · n O(1). The problem has applications in Physical Mapping of DNA [11] and in Profile Minimization for Sparse Matrix Computations [9, 25]. For the first application, our results show tractability for the case of a small number k of false negative errors, and for the second, a small number k of zero elements in the envelope. Our algorithm performs bounded search among possible ways of adding edges to a graph to obtain an interval graph, and combines this with a greedy algorithm when graphs of a certain structure are reached by the search. The presented result is surprising, as it was not believed that a bounded search tree algorithm would suffice to answer the open question affirmatively.
Algorithmic Aspects of the ConsecutiveOnes Property
, 2009
"... We survey the consecutiveones property of binary matrices. Herein, a binary matrix has the consecutiveones property (C1P) if there is a permutation of its columns that places the 1s consecutively in every row. We provide an overview over connections to graph theory, characterizations, recognition ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We survey the consecutiveones property of binary matrices. Herein, a binary matrix has the consecutiveones property (C1P) if there is a permutation of its columns that places the 1s consecutively in every row. We provide an overview over connections to graph theory, characterizations, recognition algorithms, and applications such as integer linear programming and solving Set Cover.
Interval Completion is Fixed Parameter Tractable ∗
"... We present an algorithm with runtime O(k 2k n 3 m) for the following NPcomplete problem [9, problem GT35]: Given an arbitrary graph G on n vertices and m edges, can we obtain an interval graph by adding at most k new edges to G? This resolves the longstanding open question [17, 7, 25, 14], first p ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We present an algorithm with runtime O(k 2k n 3 m) for the following NPcomplete problem [9, problem GT35]: Given an arbitrary graph G on n vertices and m edges, can we obtain an interval graph by adding at most k new edges to G? This resolves the longstanding open question [17, 7, 25, 14], first posed by Kaplan, Shamir and Tarjan, of whether this problem was fixed parameter tractable. The problem has applications in Profile Minimization for Sparse Matrix Computations [10, 26], and our results show tractability for the case of a small number k of zero elements in the envelope. Our algorithm performs bounded search among possible ways of adding edges to a graph to obtain an interval graph, and combines this with a greedy algorithm when graphs of a certain structure are reached by the search.
A LinearTime Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
, 2010
"... A graph is triconnected if it is connected, has at least 4 vertices and the removal of any two vertices does not disconnect the graph. We give a lineartime certifying algorithm deciding triconnectivity of Hamiltonian graphs. If the input graph is triconnected, the algorithm constructs an easily che ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
A graph is triconnected if it is connected, has at least 4 vertices and the removal of any two vertices does not disconnect the graph. We give a lineartime certifying algorithm deciding triconnectivity of Hamiltonian graphs. If the input graph is triconnected, the algorithm constructs an easily checkable proof for this fact. If the input graph is not triconnected, the algorithm returns a separation pair.
The reliable algorithmic software challenge RASC : dedicated to Thomas Ottmann on the occassion of his 60th birthday
 Computer Science in Perspective, essays dedicated to Thomas Ottmann, LNCS 2598
, 2003
"... When I was asked to contribute to a volume dedicated to Thomas Ottmann’s sixtieth birthday, I ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
When I was asked to contribute to a volume dedicated to Thomas Ottmann’s sixtieth birthday, I