Results 21 to 30 of about 5,334 (178)

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., Mosca, Raffaele, Brandstädt, Andreas   +2 more
core   +1 more source

Indicators for assessing the robustness of metapopulations against habitat loss

Ecological Indicators, 2021
Habitat loss and fragmentation resulting from environmental changes are main drivers of global biodiversity loss, as the survival of metapopulations relies on the ability of individuals to disperse among suitable habitat patches.
Henriette Heer, Lucas Streib, Ralf B. Schäfer, Ulf Dieckmann   +3 more
doaj   +1 more source

Game-Perfect Semiorientations of Forests

Discussiones Mathematicae Graph Theory, 2022
We consider digraph colouring games where two players, Alice and Bob, alternately colour vertices of a given digraph D with a colour from a given colour set in a feasible way. The game ends when such move is not possible any more.
Andres Stephan Dominique, Charpentier Clément, Fong Wai Lam   +2 more
doaj   +1 more source

Tight Algorithms for Connectivity Problems Parameterized by Clique-Width [PDF]

, 2023
The complexity of problems involving global constraints is usually much more difficult to understand than the complexity of problems only involving local constraints.
Hegerfeld, Falko, Kratsch, Stefan
core   +1 more source

Jaringan Komunitas Berbasis Similaritas Topik Bahasan dan Emosi untuk Mengidentifikasi Perilaku Pengguna Twitter

Jurnal Teknologi Informasi dan Ilmu Komputer, 2023
Pandemi COVID-19 menyebabkan situasi krisis yang berdampak pada perubahan perilaku pengguna Twitter terkait pengalaman distres publik. Perubahan perilaku positif bisa berdampak positif.
Apriantoni Apriantoni, Diana Purwitasari, Agus Budi Raharjo   +2 more
doaj   +3 more sources

A proof of Mader's conjecture on large clique subdivisions in C₄‐free graphs [PDF]

, 2017
Given any integers s,t⩾2, we show that there exists some c=c(s,t)>0 such that any Ks,t‐free graph with average degree d contains a subdivision of a clique with at least cds/2(s−1) vertices.
Montgomery, Richard, Liu, Hong
core   +1 more source

Unitary Cayley graphs of Dedekind domain quotients

AKCE International Journal of Graphs and Combinatorics, 2016
If X is a commutative ring with unity, then the unitary Cayley graph of X, denoted GX, is defined to be the graph whose vertex set is X and whose edge set is {{a,b}:a−b∈X×}.
Colin Defant
doaj   +1 more source

Strong cliques and equistability of EPT graphs

Discrete Applied Mathematics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alcón, L., Gutierrez, M., Kovács, I., Milanič, M., RIZZI, ROMEO   +4 more
openaire   +3 more sources

Cop-width, flip-width and strong colouring numbers [PDF]

Discrete Mathematics & Theoretical Computer Science
Cop-width and flip-width are new families of graph parameters introduced by Toru\'nczyk (2023) that generalise treewidth, degeneracy, generalised colouring numbers, clique-width and twin-width.
Robert Hickingbotham
doaj   +1 more source

The general position problem and strong resolving graphs

Open Mathematics, 2019
The general position number gp(G) of a connected graph G is the cardinality of a largest set S of vertices such that no three pairwise distinct vertices from S lie on a common geodesic.
Klavžar Sandi, Yero Ismael G.
doaj   +1 more source