Transitive reduction of a rectangular Boolean matrix

DOI10.1016/0166-218X(84)90098-2zbMATH Open0546.05013OpenAlexW2032315154WikidataQ126975581 ScholiaQ126975581MaRDI QIDQ798324FDOQ798324

Hiroshi Hashimoto

Publication date: 1984

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(84)90098-2

Recommendations

• Transitive reduction of a nilpotent Boolean matrix
• A reflexive matrix contracting based square algorithm for calculating the transitive closure of a Boolean matrix
• Boolean matrices and their applications to covering reductions
• On reduction of transitive fuzzy matrices and its applications
• The Boolean pivot operation, \(M\)-matrices, and reducible matrices

zbMATH Keywords

Boolean matrix(0,1)-matrices

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Matrix equations and identities (15A24)

Cites Work

• The Transitive Reduction of a Directed Graph
• A fuzzy model of document retrieval systems
• An Algorithm for Finding a Minimum Equivalent Graph of a Digraph
• Title not available (Why is that?)

Cited In (5)

• A reflexive matrix contracting based square algorithm for calculating the transitive closure of a Boolean matrix
• The Boolean pivot operation, \(M\)-matrices, and reducible matrices
• On reduction of transitive fuzzy matrices and its applications
• Simplification of graph structure with the aid of boolean matrices
• Transitive reduction of a nilpotent Boolean matrix

This page was built for publication: Transitive reduction of a rectangular Boolean matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798324)