Results 41 to 50 of about 10,037,549 (314)
Application of an Extremal Result of Erdős and Gallai to the (n,k,t) Problem
An extremal result about vertex covers, attributed by Hajnal to Erdős and Gallai, is applied to prove the following: If n, k, and t are integers satisfying n ≥ k ≥ t ≥ 3 and k ≤ 2t - 2, and G is a graph with the minimum number of edges among graphs on n ...
Matt Noble +3 more
doaj +1 more source
Large Independent Sets on Random d-Regular Graphs with Fixed Degree d
The maximum independent set problem is a classic and fundamental combinatorial challenge, where the objective is to find the largest subset of vertices in a graph such that no two vertices are adjacent.
Raffaele Marino, Scott Kirkpatrick
doaj +1 more source
Counting Maximal Distance-Independent Sets in Grid Graphs
Previous work on counting maximal independent sets for paths and certain 2-dimensional grids is extended in two directions: 3-dimensional grid graphs are included and, for some/any ℓ ∈ N, maximal distance-ℓ independent (or simply: maximal ℓ-independent ...
Euler Reinhardt +2 more
doaj +1 more source
Feature Extraction Using Independent Component Analysis Method from Non-Invasive Recordings of Electroencephalography (EEG) Brain Signals [PDF]
Electroencephalography (EEG) is a well known procedure in neuroscience, performed to extract brain signal activity associated with voluntary and involuntary tasks.
Ishfaque Ahmed +13 more
core +1 more source
Contribution to discussion: MegaProgram M&E, independent evaluation arrangement
The paper has three components. The first section discusses the important features of evaluation science and of research for development. The second section discusses options for the Independent Evaluation Arrangements regarding independence, other key ...
CGIAR Independent Science and Partnership Council
core
Boyle And Camps Written Evidence Independent Review of Administrative Law 19 Oct 2020 [PDF]
1.1. The exercise of power by the executive does not occur in a vacuum. It forms part of a broader constitutional framework whereby executive power is vested in government and the government and all those exercising power on behalf of the state must ...
Camps, Diana, Boyle, Katie
core
In this study, a method has been developed for solving the maximum independent set problem, which is one of the significant problems in graph theory. The maximum independent set problem is NP-hard for all types of graphs.
Furkan Öztemiz
doaj +1 more source
ABSTRACT Background Embryonal tumors comprise the majority of malignant central nervous system (CNS) neoplasms diagnosed in children under 3 years of age. Compared with their counterparts in older children, these tumors exhibit distinct molecular biology and a more aggressive clinical phenotype, while their management is complicated by the heightened ...
Sudarshawn Damodharan +3 more
wiley +1 more source
On some invariants of finite groups [PDF]
In this note we are going to survey several invariants of finite groups related either to theirorders or to generating sets or to lattices of subgroups. Some relations among these invariants will be exhibited.
Jan Krempa, Agnieszka Stocka
doaj
Layered Graphs: Applications and Algorithms
The computation of distances between strings has applications in molecular biology, music theory and pattern recognition. One such measure, called short reversal distance, has applications in evolutionary distance computation. It has been shown that this
Bhadrachalam Chitturi +3 more
doaj +1 more source

