The arborescence-realization problem
type: Item
instance of: scholarly article
title: The arborescence-realization problem
zbMATH Open document ID: 0834.68093
DOI: 10.1016/0166-218X(93)E0170-4
author: R. P. Swaminathan
author: Donald K. Wagner
published in: Discrete Applied Mathematics
publication date: 1995-07-03T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 769296
zbMATH Keywords: Horn satisfiability problems
zbMATH Keywords: arborescence graphic
zbMATH Keywords: arborescence realization
MaRDI profile type: Publication
cites work: Reliability covering problems
cites work: An Almost Linear-Time Algorithm for Graph Realization
cites work: Q3097395
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Extended Horn sets in propositional logic
cites work: A Combinatorial Decomposition Theory
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: An efficient PQ-graph algorithm for solving the graph-realization problem
cites work: Q4198056
cites work: Dividing a Graph into Triconnected Components
cites work: Information storage and retrieval - mathematical foundations. II: Combinatorial problems
cites work: Q3707420
cites work: Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs
cites work: Q5524326
cites work: 2-Isomorphic Graphs
full work available at URL: 0166-218x(93)e0170-4
OpenAlex ID: W2081601236
description: scientific article; zbMATH DE number 769296