Suchergebnisse - "Linear time algorithm"

Rphylopars: fast multivariate phylogenetic comparative methods for missing data and within‐species variation von Goolsby, Eric W., Bruggeman, Jorn, Ané, Cécile, Fitzjohn, Richard

“… Summary Over the past several years, phylogenetic comparative studies have increasingly approached trait evolution in a multivariate context, with a number of …”
Volltext

Sharp threshold for embedding balanced spanning trees in random geometric graphs von Espuny Díaz, Alberto, Lichev, Lyuben, Mitsche, Dieter, Wesolek, Alexandra

“… A rooted tree is balanced if the degree of a vertex depends only on its distance to the root. In this paper we determine the sharp threshold for the appearance …”
Volltext

Testing popularity in linear time via maximum matching von Bérczi-Kovács, Erika, Kosztolányi, Kata

“… Popularity is an approach in mechanism design to find fair structures in a graph, based on the votes of the nodes. Popular matchings are the relaxation of …”
Volltext

Computing eternal vertex cover number of maximal outerplanar graphs in linear time von Babu, Jasine, Murali Krishnan, K., Prabhakaran, Veena, Warrier, Nandini J.

“… Eternal vertex cover problem is a variant of the classical vertex cover problem modeled as a two player attacker-defender game. Computing the eternal vertex …”
Volltext

Labeling algorithm for power domination problem of trees von Lyu, Yijia

“… •The algorithm proposed in this paper is simpler and easier to understand compared to the algorithms in references [3] and [8].•The paper focuses on the power …”
Volltext

Octagonal and hexadecagonal cut algorithms for finding the convex hull of finite sets with linear time complexity von Hoang, Nam-Dũng, Linh, Nguyen Kieu, Phu, Hoang Xuan

“… This paper is devoted to an octagonal cut algorithm and a hexadecagonal cut algorithm for finding the convex hull of n points in R2, where some octagon and …”
Volltext

Planar rectilinear drawings of outerplanar graphs in linear time von Frati, Fabrizio

“… We show how to test in linear time whether an outerplanar graph admits a planar rectilinear drawing, both if the graph has a prescribed plane embedding that …”
Volltext

Configuring Intelligent Reflecting Surface With Performance Guarantees: Optimal Beamforming von Zhang, Yaowen, Shen, Kaiming, Ren, Shuyi, Li, Xin, Chen, Xin, Luo, Zhi-Quan

“… This work proposes linear time strategies to optimally configure the phase shifts for the reflective elements of an intelligent reflecting surface (IRS) …”
Volltext

Algorithms and complexity for geodetic sets on partial grids von Chakraborty, Dibyayan, Gahlawat, Harmender, Roy, Bodhayan

“… A set S of vertices of a graph G is a geodetic set if every vertex of G lies in a shortest path between some pair of vertices of S. The Minimum Geodetic Set …”
Volltext

Algorithmic study on 2-transitivity of graphs von Paul, Subhabrata, Santra, Kamal

“… Let G=(V,E) be a graph where V and E are the vertex and edge sets, respectively. For two disjoint subsets A and B of V, we say AdominatesB if every vertex of B …”
Volltext

Fast algorithms for Vizing's theorem on bounded degree graphs von Bernshteyn, Anton, Dhawan, Abhishek

“… Vizing's theorem states that every graph G of maximum degree Δ can be properly edge-colored using Δ+1 colors. The fastest currently known (Δ+1)-edge-coloring …”
Volltext

Counting independent sets in tricyclic graphs von Poureidi, Abolfazl

“… Let G be a graph of order n in the class of tricyclic graphs. In this paper, we propose an algorithm to compute the number of independent sets of G in O(n) …”
Volltext

Complexity and algorithms for injective edge coloring of graphs von Priyamvada, Panda, B.S.

“… An injective k-edge-coloring of a graph G=(V,E) is an assignment ω:E→{1,2,…,k} of colors to the edges of G such that any two edges e and f receive distinct …”
Volltext

Edge open packing: Complexity, algorithmic aspects, and bounds von Brešar, Boštjan, Samadi, Babak

“… Given a graph G, two edges e1,e2∈E(G) are said to have a common edge e≠e1,e2 if e joins an endvertex of e1 to an endvertex of e2. A subset B⊆E(G) is an edge …”
Volltext

Minimum maximal acyclic matching in proper interval graphs von Chaudhary, Juhi, Mishra, Sounaka, Panda, B.S.

“… Given a graph G, Min-Max-Acy-Matching is the problem of finding a maximal matching M in G of minimum cardinality such that the set of M-saturated vertices …”
Volltext

Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang von Araki, Toru, Saito, Ryuya

“… Zou et al. (2019) proposed an algorithm for calculating a minimum secure dominating set of a proper interval graph. However, we find a counterexample for which …”
Volltext

Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time von Keshavarz-Kohjerdi, Fatemeh, Bagheri, Alireza

“… •In this paper, we consider the problem of finding a Hamiltonian cycle for truncated rectangular grid graphs.•The necessary conditions for these graphs to be …”
Volltext

A Linear Time Algorithm for the Optimal Discrete IRS Beamforming von Ren, Shuyi, Shen, Kaiming, Li, Xin, Chen, Xin, Luo, Zhi-Quan

“… It remains an open problem to find the optimal configuration of phase shifts under the discrete constraint for intelligent reflecting surface (IRS) in …”
Volltext

On selecting a fraction of leaves with disjoint neighborhoods in a plane tree von Junginger, Kolja, Mantas, Ioannis, Papadopoulou, Evanthia

“… We present a generalization of a combinatorial result by Aggarwal et al. (1989) on a linear-time algorithm that selects a constant fraction of leaves, with …”
Volltext

Local antimagic labelling for trees von Paul, Subhabrata, Raul, Soumen

Volltext