• Corpus ID: 49880181

A Fixed-Parameter Linear-Time Algorithm to Compute Principal Typings of Planar Flow Networks

@article{Kfoury2018AFL,
  title={A Fixed-Parameter Linear-Time Algorithm to Compute Principal Typings of Planar Flow Networks},
  author={Assaf J. Kfoury},
  journal={ArXiv},
  year={2018},
  volume={abs/1807.07067}
}
  • A. Kfoury
  • Published 18 July 2018
  • Computer Science
  • ArXiv
We present an alternative and simpler method for computing principal typings of flow networks. When limited to planar flow networks, the method can be made to run in fixed-parameter linear-time -- where the parameter not to be exceeded is what is called the edge-outerplanarity of the networks' underlying graphs. 

References

SHOWING 1-10 OF 13 REFERENCES
A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks
TLDR
This work pulls together previously established graph-theoretical results to produce the algorithm in the paper's title, which is based on three easy elementary lemmas.
Determining the Smallest k Such That G Is k -Outerplanar
TLDR
A linear-time 4-approximation algorithm for the outerplanarity index is given and it is shown how it can be used to solve maximum independent set and several other NP-hard problems faster on planar graphs with outerplanularity index within a constant factor of their treewidth.
Disjoint paths in sparse graphs
  • C. Bentz
  • Mathematics
    Discret. Appl. Math.
  • 2009
Efficient reassembling of three-regular planar graphs
TLDR
An algorithm which, given a 3-regular plane graph, returns a reassembling of G with an α -measure independent of n, which is upper-bounded by 2 k, where k is the edge-outerplanarity of G .
Efficient reassembling of graphs, part 1: the linear case
TLDR
The particular case of linear reassembling, which requires that the next edge to be spliced must be adjacent to an already spliced edge, is examined, and it is proved that the known NP-hardness of CutWidth and MinArr imply the NP- hardness of α-optimization and β-optimism.
Shortest path and maximum flow problems in networks with additive losses and gains
Planarity Testing and Embedding
  • M. Patrignani
  • Computer Science
    Handbook of Graph Drawing and Visualization
  • 2013
TLDR
A comparison of the Lempel-Even-Cederbaum Algorithm with the Shih-Hsu Algorithm and the Boyer-Myrvold Algorithm shows that the former is more efficient while the latter is less efficient than the latter.
Efficient Reassembling of Graphs, Part 2: The Balanced Case
TLDR
The two main results in this report are the NP-hardness of alpha-optimization and beta- Optimization of balanced reassembling of graphs.
Safe Compositional Equation-based Modeling of Constrained Flow Networks
TLDR
The NetSketch formalism and toolset introduce a lightweight framework for constraint-based modeling and analysis of flow networks with constraints that regulate the flow of traffic and an accompanying Haskell library, HModelica, that enables the integration ofnetsketch and the OpenModelica modeling platform.
The denotational and static semantics of a domain-specific language for flow-network design
TLDR
This work inductively defined flow networks, assembled from small network modules to produce arbitrarily large ones, with interchangeable and expanding functionally equivalent parts, via a denotational semantics using a domain-specific language (DSL).
...
1
2
...