Doubly lexical orderings of matrices
SIAM Journal on Computing
Three partition refinement algorithms
SIAM Journal on Computing
Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
Discrete Mathematics - Topics on domination
A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
Information Processing Letters
Doubly lexical ordering of dense 0–1 matrices
Information Processing Letters
Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
Information Processing Letters
A note on lexicographic breadth first search for chordal graphs
Information Processing Letters
New linear time algorithms for generating perfect elimination orderings of chordal graphs
Information Processing Letters
Maximum vertex-weighted matching in strongly chordal graphs
Discrete Applied Mathematics
Matching and multidimensional matching in chordal and strongly chordal graphs
Discrete Applied Mathematics
Graph classes: a survey
The ultimate interval graph recognition algorithm?
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Algorithms for Maximum Matching and Minimum Fill-in on Chordal Bipartite Graphs
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
On Generating Strong Elimination Orderings of Strongly Chordal Graphs
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
From a simple elimination ordering to a strong elimination ordering in linear time
Information Processing Letters
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
L(2,1)-labeling of dually chordal graphs and strongly orderable graphs
Information Processing Letters
On the approximability and exact algorithms for vector domination and related problems in graphs
Discrete Applied Mathematics
Satisfiability of acyclic and almost acyclic CNF formulas
Theoretical Computer Science
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
Journal of Combinatorial Optimization
Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
Chordal bipartite graphs are introduced to analyze nonsymmetric matrices, and form a large class of perfect graphs. There are several problems, which can be solved efficiently on the class using the characterization by the doubly lexical ordering ofthe bipartite adjacency matrix. However, the best known algorithm for computing the ordering runs in O(min{mlog n, n2}), which is the bottleneck of the problems. We show a linear time algorithm that computes the ordering ofa given chordal bipartite graph. The result improves the upper bounds ofsev eral problems, including recognition problem, from O(min{mlog n, n2}) to linear time. Strongly chordal graphs are well-studied subclass of chordal graphs, and that have similar characterization. The upper bounds of several problems on a given strongly chordal graph are also improved from O(min{mlog n, n2}) to linear time.