Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph

We present efficient algorithms for chordal bipartite graphs. Both algorithms use a doubly lexical ordering of the bipartite adjacency matrix. The first algorithm computes a perfect edge without vertex elimination ordering and the second one lists all maximal complete bipartite subgraphs.

[1]  Richard P. Anstee,et al.  Characterizations of Totally Balanced Matrices , 1984, J. Algorithms.

[2]  E. van de Sluis.  A parallel local search algorithm for the travelling salesman problem , 1991 .

[3]  E. Poll,et al.  A Typechecker for Bijective Pure Type Systems , 1993 .

[4]  Jeremy P. Spinrad,et al.  Doubly Lexical Ordering of Dense 0 - 1 Matrices , 1993, Inf. Process. Lett..

[5]  van Km Kees Hee,et al.  Systems engineering : a formal approach. Part I. System concepts , 1993 .

[6]  J. P. Veltkamp,et al.  On the unavoidability of metastable behaviour , 1993 .

[7]  Jozef Hooman,et al.  A Trace-Based Compositional Proof Theory for Fault Tolerant Distributed Systems , 1994, Theor. Comput. Sci..

[8]  Lex Bijlsma,et al.  Temporal operators viewed as predicate transformers , 1993 .

[9]  Erik Poll,et al.  CPO-Models for Second Order Lambda Calculus with Recursive Types and Subtyping , 1993, RAIRO Theor. Informatics Appl..

[10]  Ajjm Jos Marcelis,et al.  An example of proving attribute grammars correct : the representation of arithmetical expressions by DAGs , 1991 .

[11]  D. de Reus,et al.  An implementation model for GOOD , 1991 .

[12]  ten Hmm Huub Eikelder,et al.  On the correctness of some algorithms to generate finite automata for regular expressions , 1993 .

[13]  Jos C. M. Baeten,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.

[14]  Jj Vereijken,et al.  Fischer's protocol in timed process algebra , 1994 .

[15]  A. Hoffman,et al.  Totally-Balanced and Greedy Matrices , 1985 .

[16]  Fairouz Kamareddine,et al.  The Barendregt Cube with Definitions and Generalised Reduction , 1996, Inf. Comput..

[17]  Frank S. de Boer,et al.  Embedding as a Tool for Language Comparison: On the CSP Hierarchy , 1991, CONCUR.

[18]  F. Rietman,et al.  A note on extensionality , 1991 .

[19]  Rp Rob Nederpelt,et al.  Implication : A survey of the different logical analyses of 'if ..., then ...' , 1992 .

[20]  Anna Lubiw,et al.  Doubly lexical orderings of matrices , 1985, STOC '85.

[21]  Jan A. Bergstra,et al.  Graph isomorphism models for non interleaving process algebra , 1994 .

[22]  T Tom Verhoeff,et al.  A continuous version of the prisoner's dilemma , 1993 .

[23]  Joost-Pieter Katoen,et al.  Parallel programs for the recognition of P-invariant segments , 1991 .

[24]  ten Hmm Huub Eikelder.  Some algorithms to decide the equivalence of recursive types , 1991 .

[25]  Frank S. de Boer,et al.  A compositional proof system for dynamic process creation , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[26]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[27]  C. W. A. M. van Overveld,et al.  Stars or Stripes: a comparative study of finite and transfinite techniques for surface modelling , 1994 .

[28]  Wjm Pim Lemmens.  The PDB hypermedia package : why and how it was built , 1991 .

[29]  van Hpj Rik Geldrop.  Deriving the Aho-Corasick algorithms : a case study into the synergy of programming methods , 1993 .

[30]  Jaa Jos Coenen,et al.  Specifying fault tolerant programs in deontic logic , 1991 .

[31]  Dieter Kratsch,et al.  Treewidth of Chordal Bipartite Graphs , 1993, J. Algorithms.

[32]  Guus Wolf,et al.  Schedule management: An object oriented approach , 1994, Decis. Support Syst..

[33]  B. Watson.  A taxonomy of finite automata construction algorithms , 1993 .

[34]  T Tom Verhoeff,et al.  The testing paradigm applied to network structure , 1994 .

[35]  Ron Selj.  A New Method for Integrity Constraint Checking in Deductive Databases , 1994 .

[36]  Martin Farber,et al.  Characterizations of strongly chordal graphs , 1983, Discret. Math..

[37]  Fairouz Kamareddine,et al.  Non well-foundedness and type freeness can unify the interpretation of functional application , 1992 .

[38]  Jan Peleska,et al.  A comparison of Ward & Mellor's transformation schema with state & activitycharts , 1994 .

[39]  W.M.P. van der Aalst,et al.  Interval timed Petri nets and their analysis , 1991 .

[40]  W. Ferrer,et al.  Abstract reduction and topology , 1993 .

[41]  Norishige Chiba,et al.  Arboricity and Subgraph Listing Algorithms , 1985, SIAM J. Comput..

[42]  Gilberto Filé,et al.  Freeness Analysis for Logic Programs - And Correctness? , 1993, ICLP.

[43]  P. D. Moerland,et al.  Exercises in multiprogramming , 1993 .

[44]  Pmp Paul Rambags,et al.  Automatic verification of regular protocols in P/T nets , 1993 .

[45]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[46]  Chris Verhoef,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates and Negative Premises , 1994, Nord. J. Comput..

[47]  Dennis Taylor,et al.  Time and order of abstract events in distributed computations , 1994 .

[48]  L. D. J. C. Loyens,et al.  ILIAS : a sequential language for parallel matrix computations , 1993 .

[49]  Doron Rotem,et al.  Recognition of Perfect Elimination Bipartite Graphs , 1982, Inf. Process. Lett..

[50]  Gerard Zwaan,et al.  A taxonomy of keyword pattern matching algorithms , 1992 .

[51]  Erik Poll,et al.  Some categorical properties for a model for second order lambda calculus with subtyping , 1991 .

[52]  B. Watson.  A taxonomy of finite automata minimization algorithms , 1993 .

[53]  T Tom Verhoeff,et al.  Quicksort for linked lists , 1993 .

[54]  Chris Verhoef,et al.  A General Conservative Extension Theorem in Process Algebra , 1994, PROCOMET.

[55]  van de E Edwin Sluis,et al.  Performance analysis of VLSI programs , 1991 .

[56]  Rt Rob Gerth.  Verifying sequentially consistent memory using interface refinement , 1993 .

[57]  Jozef Hooman,et al.  A Compositional Semantics for Fault-Tolerant Real-Time Systems , 1992, FTRTFT.