A Parametrized Analysis of Algorithms on Hierarchical Graphs

@inproceedings{Faran2017APA,
  title={A Parametrized Analysis of Algorithms on Hierarchical Graphs},
  author={Rachel Faran and Orna Kupferman},
  booktitle={DCFS},
  year={2017}
}
Hierarchical graphs are used in order to describe systems with a sequential composition of sub-systems. A hierarchical graph consists of a vector of subgraphs. Vertices in a subgraph may “call” other subgraphs. The reuse of subgraphs, possibly in a nested way, causes hierarchical graphs to be exponentially more succinct than equivalent flat graphs. Early research on hierarchical graphs and the computational price of their succinctness suggests that there is no strong correlation between the… 
LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems
TLDR
This work develops an automata-theoretic approach for reasoning about LTLA formulas and uses it in order to solve, in PSPACE, the satisfiability problem for the existential fragment of LTLA and the model-checking problem for its universal fragment.

References

SHOWING 1-10 OF 26 REFERENCES
Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs
TLDR
This paper presents the bottom-up method that solves graph problems without expanding the hierarchical description, which allows solutions that are efficient in terms of the hierarchical graph description instead of the size of the expanded graph.
Succinct Representations of Graphs
Hierarchical Network Formation Games
TLDR
This work states that hierarchical networks are exponentially more succinct than traditional “flat” networks, where a sub-network may be “called” by several boxes in the network.
Finding Regular Simple Paths in Graph Databases
TLDR
It is shown that the problem is in general intractable, but an algorithm than runs in polynomial time in the size of the graph when the regular expression and the graph are free of conflicts is presented.
Improved Model Checking of Hierarchical Systems
TLDR
By improving the algorithm for solving hierarchical parity games, this work is able to solve the model-checking problem for the μ-calculus in Pspace and time complexity that is only polynomial in the depth of the hierarchy.
Labeled shortest paths in digraphs with negative and positive edge weights
This paper gives a shortest path algorithm for CFG (context free grammar) labeled and weighted digraphs where edge weights may be positive or negative, but negative-weight cycles are not allowed in
Review of: Fundamentals of Parameterized Complexity by Rodney G. Downey and Michael R. Fellows
TLDR
Parameterized complexity allows us to completely determine the effect of a parameter on the complexity of a certain problem, which means that instances of the problem where k is small are easier to handle than others.
An Automata-Theoretic Approach to
TLDR
Regular XPath (RXPath) is presented, which is a natural extension of XPath with regular expressions over paths that has the same computational properties as XPath: linear-time query evaluation and exponential-time reasoning.
...
...