Results 61 to 70 of about 6,576,413 (265)
Finding a maximum induced degenerate subgraph faster than 2^n
, 2012 In this paper we study the problem of finding a maximum induced d-degenerate subgraph in a given n-vertex graph from the point of view of exact algorithms. We show that for any fixed d one can find a maximum induced d-degenerate subgraph in randomized (2-
Pilipczuk, Marcin, Pilipczuk, Michał
core +1 more source
Networks, EarlyView.ABSTRACT The minimum s$$ s $$‐t$$ t $$‐cut problem is one of the most‐studied problems in discrete optimization and has a unique complexity status in multi‐objective optimization. Even though the single‐objective version of the problem can be solved in polynomial time, it has been shown in the seminal work of Papadimitriou and Yannakakis (2000) that ...
Jan Boeckmann +4 more
wiley +1 more source
Mathematics OpenThe cycle graph of a graph G is the graph [Formula: see text] whose vertices are the induced cycles of G and where two vertices are adjacent if and only if they are distinct induced cycles that share a common edge.
Severino V. Gervacio, Yvette F. Lim
doaj +1 more source
New graph classes characterized by weak vertex separators and two-pairs
AKCE International Journal of Graphs and Combinatorics, 2017 A set of vertices whose deletion from a graph would increase the distance between two remaining vertices is called a weak vertex separator of the graph. Two vertices form a two-pair if all chordless paths between them have length .
Terry A. McKee
doaj +1 more source
A Zero Knowledge Authentication Protocol Based on Novel Heuristic Algorithm of Dense Induced Subgraphs Isomorphism [PDF]
Engineering and Technology Journal, 2015 Graphs provide an useful mathematical tool for modeling various real world phenomena. Dense graphs arise in many places of interest, for instance the internet and social networks to name just two. The density of a graph should be a real number reflecting
N. M. G. Al-Saidi +2 more
doaj +1 more source
Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs
Networks, EarlyView.ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w)$$ G=\left(V,\kern0.3em E,\kern0.3em w\right) $$ is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP$$ \mathbf{NP} $$‐hard. Next to 13 novel data
Jannick Borowitz +2 more
wiley +1 more source
Strong ƒ-Star Factors of Graphs
Discussiones Mathematicae Graph Theory, 2015 Let G be a graph and f : V (G) → {2, 3, . . .}. A spanning subgraph F is called strong f-star of G if each component of F is a star whose center x satisfies degF (x) ≤ ƒ(x) and F is an induced subgraph of G.
Yan Zheng
doaj +1 more source
Embedability between right-angled Artin groups
, 2011 In this article we study the right-angled Artin subgroups of a given right-angled Artin group. Starting with a graph $\gam$, we produce a new graph through a purely combinatorial procedure, and call it the extension graph $\gam^e$ of $\gam$. We produce a
Farb +3 more
core +2 more sources
Discrete Mathematics, 1988 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Egawa, Yoshimi +2 more
openaire +2 more sources
Solar RRL, EarlyView.This study investigates the effect of the chemical composition on the properties of A(BB’)(XX’)3$_3$ inorganic halide perovskites with density functional theory. By correlating distortion amplitudes with both composition and the Goldschmidt tolerance factor, we propose a pragmatic approach to designing more stable and efficient perovskites, advancing ...
Antoine Gissler +2 more
wiley +1 more source