Intersection representations of matrices by subtrees and unicycles on graphs
type: Item
instance of: scholarly article
title: Intersection representations of matrices by subtrees and unicycles on graphs
zbMATH Open document ID: 1146.05033
author: Fanica Gavril
author: Shmuel Zaks
author: Ron Y. Pinter
published in: Journal of Discrete Algorithms
publication date: 2008-08-08T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 5309335
zbMATH Keywords: intersection representation of a matrix
zbMATH Keywords: intersection graph
zbMATH Keywords: hypergraph
zbMATH Keywords: unicycle graph
zbMATH Keywords: biological network clustering
MaRDI profile type: Publication
full work available at URL: j.jda.2007.08.001
OpenAlex ID: W2077900886
cites work: Q4091421
cites work: Power of Natural Semijoins
cites work: Maximal sub-triangulation in pre-processing phylogenetic data
cites work: A characterisation of rigid circuit graphs
cites work: Q3222876
cites work: Planar linear arrangements of outerplanar graphs
cites work: Incidence matrices and interval graphs
cites work: Algorithms on circular-arc graphs
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: A recognition algorithm for the intersection graphs of directed paths in directed trees
cites work: A recognition algorithm for the intersection graphs of paths in trees
cites work: Generating the maximum spanning trees of a weighted graph
cites work: Intersection graphs of Helly families of subtrees
cites work: Intersection graphs of concatenable subtrees of graphs
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: A Simpler Linear-Time Recognition of Circular-Arc Graphs
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Acyclic Hypergraph Projections
cites work: Q4526776
cites work: Q4138414
cites work: A faster algorithm to recognize undirected path graphs
cites work: Recognition of Circle Graphs
cites work: Matrix characterizations of circular-arc graphs
cites work: Circular representation problem on hypergraphs
DOI: 10.1016/J.JDA.2007.08.001
description: scientific article; zbMATH DE number 5309335