Hamiltonian problems for reducible flowgraphs

  title={Hamiltonian problems for reducible flowgraphs},
  author={Oswaldo Vernet and Lilian Markenzon},
  journal={Proceedings 17th International Conference of the Chilean Computer Science Society},
  • Oswaldo Vernet, L. Markenzon
  • Published 12 November 1997
  • Mathematics, Physics
  • Proceedings 17th International Conference of the Chilean Computer Science Society
We discuss Hamiltonian problems for reducible flowgraphs. The main result is finding, in linear time, the unique Hamiltonian cycle, if it exists. In order to obtain this result, two other related problems are solved: finding the Hamiltonian path starting at the source vertex and finding the Hamiltonian cycle given the Hamiltonian path. 

Figures from this paper

Topological Sort Algorithm according to the Principle of a DAG’s Subgraphis still a DAG after Outputting a Start Node

The paper proves that a DAG’s subgraph is still a D AG or empty after deleting a start node, and proposes using key-value storage structure to represent aDAG, where each node as the key, the node’'s subsequent nodes as the values.

Problem dependent metaheuristic performance in Bayesian network structure learning

A new algorithm for producing BN benchmark structures is constructed and a selective hyperheuristic algorithm is built for unseen BN structure learning with search and score algorithms to understand the relationship between technique performance and structure features of the problems.

Fitness landscape analysis of Bayesian network structure learning

Fitness landscape analysis is used to explain empirically-observed performance differences between particular search-and-score algorithms on two well-studied benchmark problems, and the average landscape discovered by random walks around optimal points in the space of BN node orderings is investigated.

Alerts Correlation and Causal Analysis for APT Based Cyber Attack Detection

An approach for real-time detection of APT based cyber-attacks based on causal analysis and correlating the generated alerts by security and non-security sensors is introduced and results show that the proposed approach can effectively rank hosts based on their infection likelihood with acceptable accuracy.



Flow graph reducibility

This work characterize the set of flow graphs that can be analyzed in this way in terms of two very simple transformation on graphs and gives a necessary and sufficient condition for analyzability and applies it to “goto-less programs,” showing that they all meet the criterion.

On structured digraphs and program testing

To model interactions among code segments the notions of `required pairs' and `must pairs' are introduced and the corresponding constrained path cover problems are shown to be NP-complete even for acyclic structured digraphs.

Algorithmic graph theory

Introduction to graph theory algorithmic techniques shortest paths trees and acyclic diagraphs depth first search connectivity and routing graph colouring covers, domination, independent sets,

An incremental algorithm for maintaining the dominator tree of a reducible flowgraph

We present a new incremental algorithm for the problem of maintaining the dominator tree of a reducible flowgraph as the flowgraph undergoes changes such as the insertion and deletion of edges. Such

On Path Cover Problems in Digraphs and Applications to Program Testing

In this paper various path cover problems, arising in program testing, are discussed and it is shown that rmding a minimum path cover for a set of required pairs is NP-hard.

Incremental data flow analysis via dominator and attribute update

This work reduces a monotone data flow problem formulated for solution using Graham-Wegman elimination to the problem of constructing and decorating an attributed tree structurally isomorphic to the dominator tree of the program flow graph, and extends Reps' attributed tree update techniques to update attribute values in response to changes in this structure.

On Two Problems in the Generation of Program Test Paths

An efficient algorithm is given for the problem of building a path through a specified set of program statements which satisfies impossible-pairs restrictions on statement pairs, and it is shown that the second problem is NP-complete.

Data structures and network algorithms

  • R. Tarjan
  • Computer Science
    CBMS-NSF regional conference series in applied mathematics
  • 1983
This paper presents a meta-trees tree model that automates the very labor-intensive and therefore time-heavy and therefore expensive process of manually selecting trees to grow in a graph.

Computers and Intractability: A Guide to the Theory of NP-Completeness

The experiences, understandings, and beliefs that guide the professional practices of teacher educators are explored, and the book paints a picture of a profession that offers huge rewards, alongside challenges and frustrations.

Characterizations of Reducible Flow Graphs

The backward edges of a reducible flow graph are unique and it is shown that there is a “natural” single-entry loop associated with each backward edge of a reducing flow graph.