An efficient algorithm for finding a maximum weight two-independent set on interval graphs
, 2012 [[abstract]]In this paper, we introduce an O(n) time algorithm to solve the maximum weight independent set problem on an interval graph with n vertices given its interval representation with sorted endpoints list.
Ju Yuan Hsiao;Chuan Yi Tang;Ruay Shiung Chang +2 more
core +1 more source
Independent 2-point set domination in graphs with specified girth
AKCE International Journal of Graphs and CombinatoricsA set D of vertices in a connected graph G is said to be an independent 2-point set dominating set (or in short i-2psd set) of G if D is an independent set and for every subset [Formula: see text] there exists a non-empty subset [Formula: see text ...
Deepti Jain
doaj +1 more source
Maximum Independent Set Of A Permutation Graph In K Tracks
, 1993 A maximum weighted independent set of a permutation graph is a maximum subset of noncrossing chords in a matching diagram (i.e., a set \Phi of chords with end-points on two horizontal lines).
Majid Sarrafzadeh, D. T. Lee
core
An Evolutionary Heuristic for the Maximum Independent Set Problem
, 1994 The results obtained from the application of a genetic algorithm, GENEsYs, to the NP-complete maximum independent set problem are reported in this work. In contrast to many other genetic algorithm based approaches that use domain-specific knowledge, the ...
Sami Khuri, Thomas Bäck
core
A Variant of the Maximum Weight Independent Set Problem
, 2014 We study a natural extension of the Maximum Weight Independent Set Problem (MWIS), one of the most studied optimization problems in Graph algorithms. We are given a graph G = (V,E), a weight function w: V → R+, a budget function b: V → Z+, and a positive
Sayan Bandyapadhyay
core
Methodological Clarification and Analysis of Demographic and Anthropometric Determinants in the Calculation of REMS Bone Mineral Density. [PDF]
Calcif Tissue IntConversano F, Pisani P, Casciaro S.
europepmc +1 more source
Independent Set on graphs with maximum degree 3
, 2010 Let G be an undirected graph with maximum degree at most 3 such that G does not contain either of the two graphs shown in Figure 1 as a subgraph. We prove that the independence number of G is at least n(G)/3 + nt(G)/63, where n(G) is the number of ...
Kanj, Iyad A, Zhang, Fenghui
core
Methods for Analyzing RNA Pseudoknots via Chord Diagrams and Intersection Graphs. [PDF]
Bull Math BiolIbrahim R, Moore AH.
europepmc +1 more source
A predictive nomogram for in-ICU deterioration of stage 1 pressure injuries: a retrospective study. [PDF]
Front Med (Lausanne)Zhang C, Dong Z, Wang W, Chen C, Xu H.
europepmc +1 more source
A clinically practical machine learning nomogram for preoperative CLNM prediction in PTMC: tumor-capsule distance and D2-40 evidence. [PDF]
Front OncolLing Z +6 more
europepmc +1 more source