scholarly journals Comparative analysis of box-covering algorithms for fractal networks

2021 ◽  
Vol 6 (1) ◽  
Author(s):  
Péter Tamás Kovács ◽  
Marcell Nagy ◽  
Roland Molontay
Keyword(s):  
Comparative Analysis ◽  
Network Science ◽  
Central Issue ◽  
Np Hard ◽  
Unified Framework ◽  
Running Time ◽  
Covering Algorithms ◽  
Covering Method

AbstractResearch on fractal networks is a dynamically growing field of network science. A central issue is to analyze the fractality with the so-called box-covering method. As this problem is known to be NP-hard, a plethora of approximating algorithms have been proposed throughout the years. This study aims to establish a unified framework for comparing approximating box-covering algorithms by collecting, implementing, and evaluating these methods in various aspects including running time and approximation ability. This work might also serve as a reference for both researchers and practitioners, allowing fast selection from a rich collection of box-covering algorithms with a publicly available codebase.

Comparative Analysis of MRAC Architectures in a Unified Framework

2010 ◽  
Author(s):  
Thomas Bierling ◽  
Leonhard Höcht ◽  
Florian Holzapfel ◽  
Rudolf Maier ◽  
Andreas Wildschek
Keyword(s):  
Comparative Analysis ◽  
Unified Framework

A Comparative Analysis of Congestion Management Schemes under a Unified Framework

2002 ◽  
Vol 22 (11) ◽  
pp. 59-60 ◽  
Author(s):  
E. Bompard ◽  
P. Correia ◽  
G. Gross ◽  
M. Amelin
Keyword(s):  
Comparative Analysis ◽  
Congestion Management ◽  
Unified Framework ◽  
Management Schemes

SOME IMPROVED ALGORITHMS ON THE SINGLE MACHINE HIERARCHICAL SCHEDULING WITH TOTAL TARDINESS AS THE PRIMARY CRITERION

2010 ◽  
Vol 27 (05) ◽  
pp. 577-585 ◽  
Author(s):  
CHENG HE ◽  
YIXUN LIN ◽  
JINJIANG YUAN
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Total Tardiness ◽  
Scheduling Problem ◽  
Np Hard ◽  
Assignment Problems ◽  
Running Time ◽  
Minimization Problems ◽  
Hierarchical Minimization

It is well-known that a single machine scheduling problem of minimizing the total tardiness is NP-hard. Recently, Liu, Ng and Cheng solved some special hierarchical minimization problems with total tardiness as the primary criterion by the Algorithm TAP (Two Assignment Problems) in O(n3) time. And in this paper we present some algorithms for these problems with running time O(n log n).

scholarly journals Deciding Relaxed Two-Colourability: A Hardness Jump

2009 ◽  
Vol 18 (1-2) ◽  
pp. 53-81 ◽  
Author(s):  
R. BERKE ◽  
T. SZABÓ
Keyword(s):  
Decision Problem ◽  
Maximum Degree ◽  
Time Algorithm ◽  
Np Hard ◽  
Running Time ◽  
Symmetric Version ◽  
Component Order ◽  
Colour Classes

We study relaxations of proper two-colourings, such that the order of the induced monochromatic components in one (or both) of the colour classes is bounded by a constant. A colouring of a graph G is called (C1, C2)-relaxed if every monochromatic component induced by vertices of the first (second) colour is of order at most C1 (C2, resp.). We prove that the decision problem ‘Is there a (1, C)-relaxed colouring of a given graph G of maximum degree 3?’ exhibits a hardness jump in the component order C. In other words, there exists an integer f(3) such that the decision problem is NP-hard for every 2 ≤ C < f(3), while every graph of maximum degree 3 is (1, f(3))-relaxed colourable. We also show f(3) ≤ 22 by way of a quasilinear time algorithm, which finds a (1, 22)-relaxed colouring of any graph of maximum degree 3. Both the bound on f(3) and the running time greatly improve earlier results. We also study the symmetric version, that is, when C1 = C2, of the relaxed colouring problem and make the first steps towards establishing a similar hardness jump.

scholarly journals CAMSA: a Tool for Comparative Analysis and Merging of Scaffold Assemblies

2016 ◽  
Author(s):  
Sergey S. Aganezov ◽  
Max A. Alekseyev
Keyword(s):  
Comparative Analysis ◽  
Genome Sequencing ◽  
Recent Progress ◽  
Quality Metrics ◽  
Running Time ◽  
Link Type ◽  
Partial Error ◽  
Wet Lab ◽  
The Given

MotivationDespite the recent progress in genome sequencing and assembly, many of the currently available assembled genomes come in a draft form. Such draft genomes consist of a large number of genomic fragments (scaffolds), whose positions and orientations along the genome are unknown. While there exists a number of methods for reconstruction of the genome from its scaffolds, utilizing various computational and wet-lab techniques, they often can produce only partial error-prone scaffold assemblies. It therefore becomes important to compare and merge scaffold assemblies produced by different methods, thus combining their advantages and highlighting present conflicts for further investigation. These tasks may be labor intensive if performed manually.ResultsWe present CAMSA—a tool for comparative analysis and merging of two or more given scaffold assemblies. The tool (i) creates an extensive report with several comparative quality metrics; (ii) constructs the most confident merged scaffold assembly; and (iii) provides an interactive framework for a visual comparative analysis of the given assemblies. Among the CAMSA features, only scaffold merging can be evaluated in comparison to existing methods. Namely, it resembles the functionality of assembly reconciliation tools, although their primary targets are somewhat different. Our evaluations show that CAMSA produces merged assemblies of comparable or better quality than existing assembly reconciliation tools while being the fastest in terms of the total running time.AvailabilityCAMSA is distributed under the MIT license and is available at http://cblab.org/camsa/.

scholarly journals Puzzle Plots in TV Serials: The Challenges for Enigma-Driven Storytelling in Long-Running Formats

Panoptikum ◽  
2019 ◽  
pp. 144-157
Author(s):  
Matthias Brütsch
Keyword(s):  
Comparative Analysis ◽  
Feature Film ◽  
Running Time ◽  
The Core ◽  
Lack Of Knowledge

The article conducts a comparative analysis of a feature film (Open your Eyes) and two TV serials (Westworld and Dark) in order to find out how well the narrative complexity characteristic of puzzle plots may work in long-running formats. Given the core constituents of the puzzle effect ‒ disorientation, confusion, and lack of knowledge ‒ the biggest challenge for its viability in a TV serial is the extra-long running time. Both Westworld and Dark prevent audience frustration by already providing partial resolutions before the season ends, and by establishing supplementary attractions of a more classical and easy-to-grasp nature, such as future-oriented suspense-questions, or entertaining intrigues and machinations involving the whole cast of protagonists. Even in the larger structure of the TV serial, puzzle elements may, then, play an important role. However, spectators’ capacities to unravel convoluted plotlines have their limits, and the final revelation of what really happened may only satisfy if the entanglements are not overly construed. Due to these high demands, puzzle plots in TV serials will likely remain a niche phenomenon.

scholarly journals A Parameterized Measure-and-ConquerAnalysis for Finding a k-Leaf Spanning Treein an Undirected Graph

2014 ◽  
Vol Vol. 16 no. 1 (Discrete Algorithms) ◽  
Author(s):  
Daniel Binkele-Raible ◽  
Henning Fernau
Keyword(s):  
Spanning Tree ◽  
Undirected Graph ◽  
Standard Measure ◽  
Algorithm Analysis ◽  
Np Hard ◽  
Running Time ◽  
Discrete Algorithms ◽  
Parameterized Algorithmics ◽  
International Audience ◽  
Number Of Leaves

Discrete Algorithms International audience The problem of finding a spanning tree in an undirected graph with a maximum number of leaves is known to be NP-hard. We present an algorithm which finds a spanning tree with at least k leaves in time O*(3.4575k) which improves the currently best algorithm. The estimation of the running time is done by using a non-standard measure. The present paper is one of the still few examples that employ the Measure & Conquer paradigm of algorithm analysis in the area of Parameterized Algorithmics.

Sign in / Sign up

Export Citation Format

Share Document