Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
type: Item
instance of: scholarly article
title: Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
zbMATH Open document ID: 0875.68458
DOI: 10.1016/0020-0190(95)00027-A
author: Dieter Kratsch
author: Ton Kloks
published in: Information Processing Letters
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 985026
zbMATH Keywords: Design of algorithms
zbMATH Keywords: Efficient algorithms
zbMATH Keywords: Chordal bipartite graphs
MaRDI profile type: Publication
cites work: Characterizations of totally balanced matrices
cites work: Arboricity and Subgraph Listing Algorithms
cites work: Characterizations of strongly chordal graphs
cites work: Recognition of perfect elimination bipartite graphs
cites work: Q3328583
cites work: Totally-Balanced and Greedy Matrices
cites work: Q4281510
cites work: Doubly Lexical Orderings of Matrices
cites work: Three Partition Refinement Algorithms
cites work: Doubly lexical ordering of dense 0--1 matrices
full work available at URL: 0020-0190(95)00027-a
OpenAlex ID: W2033023054
description: scientific article; zbMATH DE number 985026