ILIGRA: An Efficient Inverse Line Graph Algorithm
نویسندگان
چکیده
منابع مشابه
ILIGRA: An Efficient Inverse Line Graph Algorithm
This paper presents a new and efficient algorithm, ILIGRA, for inverse line graph construction. Given a line graph H , ILIGRA constructs its root graph G with the time complexity being linear in the number of nodes in H . If ILIGRA does not know whether the given graph H is a line graph, it firstly assumes that H is a line graph and starts its root graph construction. During the root graph cons...
متن کاملAn Efficient MATLAB Algorithm for Graph Partitioning
This report describes a graph partitioning algorithm based on spectral factorization that can be implemented very efficiently with just a hand full of MATLAB commands. The algorithm is closely related to the one proposed by Phillips and Kokotović [3] for state-aggregation in Markov chains. The appendix contains a MATLAB script that implements the algorithm. 1 Graph partitioning Consider an undi...
متن کاملAn efficient graph algorithm for dominance constraints
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we identify normal dominance constraints and present an efficient graph algorithm for testing their satisfiablity in deterministic polynomial time. Previously, no polynomial time algorithm was known.
متن کاملAn Efficient Inverse Scattering Algorithm and Its Application to Lossy Electric Trans- Mission Line Synthesis
As studied by Jaulent in 1982, the inverse problem of lossy electric transmission lines is closely related to the inverse scattering of Zakharov-Shabat equations with two potential functions. Focusing on the numerical solution of this inverse scattering problem, we develop a fast one-shot algorithm based on the Gelfand-LevitanMarchenko equations and on some differential equations derived from t...
متن کاملAn Efficient Algorithm for Estimating the Inverse Optical Flow
The aim of this work is to propose a method for computing the inverse optical flow between two frames in a sequence. We assume that the image registration has already been obtained in one direction and we need to estimate the mapping in the opposite direction. The direct and inverse mappings can easily be related through a simple warping formula, which allows us to propose a fast and efficient ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Modelling and Algorithms in Operations Research
سال: 2014
ISSN: 2214-2487,2214-2495
DOI: 10.1007/s10852-014-9251-2