|
|
|
|
|
Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen Kobourov, Giuseppe Liotta, Alfredo Navarra and Alessandra Tappini
This paper introduces and studies the following beyond-planarity problem, which we call h-Clique2Path Planarity. Let G be a simple topological graph whose vertices are partitioned into subsets of size at most h, each inducing a clique. h-Clique2Path Plan...
ver más
|
|
|
|
|
|
|
|
|
|
|
Candido Ferreira Xavier de Mendonça Neto, Peter Eades (Author)
Pág. 841 - 845
Given a directed graph G, a covering is a subset B of arcs which meets all directed cuts of G. Equivalently, the contraction of the elements of B makes G strongly connected. An O(n5) primal-dual algorithm is presented by Frank (1981) for finding a minimu...
ver más
|
|
|
|
|
|
|
|
|
|
|
Chuan-Min Lee
This paper studies the maximum-clique independence problem and some variations of the clique transversal problem such as the {??}
{
k
}
-clique, maximum-clique, minus clique, signed clique, and k-fold clique transversal problems from algorithmic aspects ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Wael S. Amer, Tarek S. Amer, Roman Starosta and Mohamed A. Bek
The major objective of this research is to study the planar dynamical motion of 2DOF of an auto-parametric pendulum attached with a damped system. Using Lagrange?s equations in terms of generalized coordinates, the fundamental equations of motion (EOM) a...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jonathan Li, Rohan Potru and Farhad Shahrokhi
We implement and test the performances of several approximation algorithms for computing the minimum dominating set of a graph. These algorithms are the standard greedy algorithm, the recent Linear programming (LP) rounding algorithms and a hybrid algori...
ver más
|
|
|
|
|
|