Recognizing hidden bicircular networks

DOI10.1016/0166-218X(93)90243-HzbMath0781.90089WikidataQ59592655 ScholiaQ59592655MaRDI QIDQ1208462

Randy Shull, Alan Shuchat, Marianne Lepp, James B. Orlin

Publication date: 16 May 1993

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

zbMATH Keywords

polynomial-time algorithmbicircular generalized networkgeneralized network flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Deterministic network models in operations research (90B10) Paths and cycles (05C38) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Recognizing hidden bicircular networks ⋮ Uncovering generalized-network structure in matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The structure of bases in bicircular matroids
• Connectivity in bicircular matroids
• An efficient PQ-graph algorithm for solving the graph-realization problem
• Signed graphs
• Representations of bicircular matroids
• Recognizing hidden bicircular networks
• On matroids on edge sets of graphs with connected subgraphs as circuits. II
• Recognizing a class of bicircular matroids
• On subgraphs as matroid cells
• Matrix characterizations of circular-arc graphs
• BICIRCULAR GEOMETRY AND THE LATTICE OF FORESTS OF A GRAPH
• An Almost Linear-Time Algorithm for Graph Realization
• Converting Linear Programs to Network Problems
• BICIRCULAR MATROIDS