Results 21 to 30 of about 10,268,798 (293)
Independent sets of maximum weight in apple-free graphs [PDF]
, 2010 We present the first polynomial-time algorithm to solve the maximum weight independent set problem for apple-free graphs, which is a common generalization of several important classes where the problem can be solved efficiently, such as claw-free graphs,
Lozin, Vadim V. +2 more
core +1 more source
Determination of the Maximum Set Independent Simple Paths between the Vertices of the Graph
Современные информационные технологии и IT-образование, 2021 This article presents an algorithm for determining the maximum number of independent simple paths, as well as the paths themselves, between the given vertices of the graph.
Yulia Terentyeva
doaj +1 more source
On the maximum number of maximum independent sets of bipartite graphs
Mediterranean Journal of Mathematics, 2023 Abstract An independent set in a graph G is a set of pairwise non-adjacent vertices of G. The independence number, α, of G is the maximum cardinality of an independent set in G. An independent set in G is maximum if it has cardinality α. Mohr and Rautenbach determined the n-vertex trees (resp.
Sun, Wanting, Li, Shuchao
openaire +2 more sources
Approximation hardness of dominating set problems in bounded degree graphs [PDF]
, 2008 We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum Set Cover we prove the first explicit approximation lower bounds for various
Chlebikova, Janka +4 more
core +1 more source
Spanning k-Ended Tree in 2-Connected Graph
Axioms, 2023 Win proved a very famous conclusion that states the graph G with connectivity κ(G), independence number α(G) and α(G)≤κ(G)+k−1(k≥2) contains a spanning k-ended tree. This means that there exists a spanning tree with at most k leaves.
Wanpeng Lei, Jun Yin
doaj +1 more source
Maximum Weighted Independent Sets with a Budget [PDF]
, 2017 12 ...
Tushar Kalra +3 more
openaire +3 more sources
Coloring and Maximum Weight Independent Set of Rectangles [PDF]
, 2021 In 1960, Asplund and Grünbaum proved that every intersection graph of axis-parallel rectangles in the plane admits an $O(ω^2)$-coloring, where $ω$ is the maximum size of a clique. We present the first asymptotic improvement over this six-decade-old bound, proving that every such graph is $O(ω\logω)$-colorable and presenting a polynomial-time algorithm ...
Chalermsook, Parinya, Walczak, Bartosz
openaire +5 more sources
Large neighborhood local search for the maximum set packing problem [PDF]
, 2013 In this paper we consider the classical maximum set packing problem where set cardinality is upper bounded by a constant k. We show how to design a variant of a polynomial-time local search algorithm with performance guarantee (k + 2)/3.
Sviridenko, Maxim +3 more
core +1 more source
An evolutionary algorithm for the robust maximum weighted independent set problem
Automatika, 2020 This work deals with the robust maximum weighted independent set problem, i.e. finding a subset of graph vertices that are not adjacent to each other and whose sum of weights is as large as possible.
Ana Klobučar, Robert Manger
doaj +1 more source
Solving Robust Variants of the Maximum Weighted Independent Set Problem on Trees
Mathematics, 2020 This paper deals with the maximum weighted independent set (MWIS) problem. We consider several robust variants of the MWIS problem on trees and prove that most of them are NP-hard.
Ana Klobučar, Robert Manger
doaj +1 more source