Flow hypergraph reducibility
type: Item
instance of: scholarly article
title: Flow hypergraph reducibility
zbMATH Open document ID: 1228.05165
author: Juan-Miguel Gracia
published in: Discrete Applied Mathematics
publication date: 2011-10-27T00:00:00Z
Mathematics Subject Classification ID: 05C21
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 5964715
zbMATH Keywords: directed hypergraphs
zbMATH Keywords: flowgraphs
zbMATH Keywords: graph reducibility
MaRDI profile type: Publication
full work available at URL: j.dam.2011.02.006
OpenAlex ID: W2173194027
cites work: Q5187320
cites work: Some Properties of Conversion
cites work: Directed hypergraphs and applications
cites work: A note on minimum makespan assembly plans
cites work: Flow Graph Reducibility
cites work: Characterizations of Reducible Flow Graphs
cites work: A directed hypergraph model for random time dependent shortest paths
cites work: A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs
cites work: Testing flow graph reducibility
cites work: Linear connectivity problems in directed hypergraphs
cites work: Solving problems for maximal reducible flowgraphs.
cites work: The complexity of arc-colorings for directed hypergraphs
DOI: 10.1016/J.DAM.2011.02.006
description: scientific article; zbMATH DE number 5964715