Results 261 to 270 of about 10,268,798 (293)

Robust Broadband Differential Beamforming for Fully Steerable Linear Superarrays with Prescribed Nulls. [PDF]

Sensors (Basel)
Wang Y, Zhang Y, Ding J, Ning J, Zhu Q.
europepmc   +1 more source

Clinical heterogeneity mapping and machine learning-based prediction of recurrence in gallstone disease: a retrospective cohort study of 9,939 patients. [PDF]

PeerJ
Zheng X, Yan Y, Bian C, Sun X, Bai X, Zhuang X, Zhang Y.   +6 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Finding a Maximum Independent Set

SIAM Journal on Computing, 1977
We present an algorithm which finds a maximum independent set in an n-vertex graph in 0($2^{n/3}$) time. The algorithm can thus handle graphs roughly three times as large as could be analyzed using a naive algorithm.
Robert Endre Tarjan, Anthony E. Trojanowski   +1 more
exaly   +2 more sources

Algorithms for a maximum clique and a maximum independent set of a circle graph

Networks, 1973
AbstractConsider a family of chords in a circle. A circle graph is obtained by representing each chord by a vertex, two vertices being connected by an edge when the corresponding chords intersect. In this paper, we describe efficient algorithms for finding a maximum clique and a maximum independent set of circle graphs. These algorithms require at most
exaly   +4 more sources

Maximum Independent Sets and Supervised Learning

Journal of the Operations Research Society of China, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Roberto Montemanni, Derek H. Smith, Xiaochen Chou   +2 more
openaire   +4 more sources

Maximum Renamable Horn and Maximum Independent Sets

2009 WRI World Congress on Computer Science and Information Engineering, 2009
A clause set is renamable Horn if the result replacing part propositional variable with its complement is a set of Horn clauses. The renamable Horn problem is solvable in linear time, but the maximum renamable Horn problem (MAX-RHS) is NP-hard. In this paper, we present transformations between clause sets and undirected graphs in polynomial time, such ...
Yongbin Qin, Daoyun Xu
openaire   +1 more source

Algorithms for maximum independent sets

Journal of Algorithms, 1986
Summary: An algorithm is presented which finds (the size of) a maximum independent set of an n vertex graph in time \(O(2^{0.276n})\) improving on a previous bound of \(O(2^{n/3})\). The improvement comes principally from three sources: first, a modified recursive algorithm based on a more detailed study of the possible subgraphs around a chosen vertex:
openaire   +3 more sources

Nonseparating Independent Sets and Maximum Genus of Graphs

Acta Mathematicae Applicatae Sinica, English Series, 2022
A subset $I$ of vertices of a graph $G$ is called a non-separating independent set if no two vertices of $I$ are adjacent and $G-I$ is connected. The maximum size of a non-separating independent set of $G$ is denoted by $Z(G)$ and is called the maximum non-separating independence number. For a connected graph $G$ and a surface $P$, the graph $G$ can be
Yang, Chao, Ren, Han, Wei, Er-ling
openaire   +2 more sources

On the Maximum Independent Set Problem in Graphs of Bounded Maximum Degree

Acta Mathematica Vietnamica, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ngoc C. Lê, Trung Tran
openaire   +1 more source

The structure and maximum number of maximum independent sets in trees

Journal of Graph Theory, 1991
AbstractA subset of vertices is a maximum independent set if no two of the vertices are joined by an edge and the subset has maximum cardinality. in this paper we answer a question posed by Herb Wilf. We show that the greatest number of maximum independent sets for a tree of n vertices ismagnified imageWe give the families of trees on which these ...
openaire   +3 more sources