Results 31 to 40 of about 2,421,288 (269)
Application of an Extremal Result of Erdős and Gallai to the (n,k,t) Problem
Theory and Applications of Graphs, 2017 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
Counting Maximal Distance-Independent Sets in Grid Graphs
Discussiones Mathematicae Graph Theory, 2013 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
On the independent set interdiction problem
Electronic Journal of Graph Theory and Applications, 2015 The purpose of the independent set interdiction problem in the weighted graph $G$ is to determine a set of vertices $R^*$ such that the weight of the maximum independent set in $G-R^*$ is minimized.
Gholam Hassan Shirdel, Nasrin Kahkeshani
doaj +1 more source
Coloring and Guarding Arrangements [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Combinatorics
Prosenjit Bose +6 more
doaj +1 more source
Recoverable Values for Independent Sets [PDF]
Random Structures & Algorithms, 2011 AbstractThe notion of recoverable value was advocated in the work of Feige, Immorlica, Mirrokni and Nazerzadeh (APPROX 2009) as a measure of quality for approximation algorithms. There, this concept was applied to facility location problems. In the current work we apply a similar framework to the maximum independent set problem (MIS).
Feige, Uriel, Reichman, Daniel
openaire +2 more sources
Engineering Science and Technology, an International JournalIn 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
Fair Packing of Independent Sets [PDF]
, 2020 In this work we add a graph theoretical perspective to a classical problem of fairly allocating indivisible items to several agents. Agents have different profit valuations of items and we allow an incompatibility relation between pairs of items described in terms of a conflict graph.
Chiarelli, Nina +5 more
openaire +2 more sources
On some invariants of finite groups [PDF]
International Journal of Group Theory, 2013 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
Two Remarks on Independent Sets [PDF]
Journal of Algebraic Combinatorics, 1993 Let \(S = k[x_ v,\;v \in V]\) be a polynomial ring over a field \(k\), equipped with a noetherian term order \(
openaire +2 more sources
Statistical mechanics of maximal independent sets [PDF]
Physical Review E, 2009 The graph theoretic concept of maximal independent set arises in several practical problems in computer science as well as in game theory. A maximal independent set is defined by the set of occupied nodes that satisfy some packing and covering constraints.
Dall'Asta, Luca +2 more
openaire +5 more sources