Flow Hypergraph Reducibility (Q3503561)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Flow Hypergraph Reducibility	scientific article

Statements

scholarly article

0 references

Flow Hypergraph Reducibility (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.endm.2008.01.044

0 references

Electronic Notes in Discrete Mathematics

0 references

publication date

5 June 2008

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

reducible flow graphs

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.endm.2008.01.044

0 references

0 references

Directed hypergraphs and applications

0 references

Flow Graph Reducibility

0 references

Characterizations of Reducible Flow Graphs

0 references

A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs

0 references

0 references

Solving problems for maximal reducible flowgraphs.

0 references

The complexity of arc-colorings for directed hypergraphs

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3503561

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3503561&oldid=35059330"