Results 21 to 30 of about 1,986,691 (177)
Counting the number of independent sets in chordal graphs [PDF]
, 2008 We study some counting and enumeration problems for chordal graphs, especially concerning independent sets. We first provide the following efficient algorithms for a chordal graph: (1) a linear-time algorithm for counting the number of independent sets; (
Uno, Takeaki +2 more
core +1 more source
Characterization of Super Strongly Perfect Graphs in Chordal and Strongly Chordal Graphs [PDF]
, 2012 A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H.
Amutha, A, Jeya Jothi, R Mary
core +1 more source
Discussiones Mathematicae Graph Theory, 2019 Several recent papers have investigated unichord-free graphs—the graphs in which no cycle has a unique chord. This paper proposes a concept of strongly unichord-free graph, defined by being unichord-free with no cycle of length 5 or more having exactly ...
McKee Terry A.
doaj +1 more source
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. +2 more
core +1 more source
The Knapsack Problem with Conflict Graphs
Journal of Graph Algorithms and Applications, 2009 We extend the classical 0-1 knapsack problem by introducing disjunctive constraints for pairs of items which are not allowed to be packed together into the knapsack. These constraints are represented by edges of a conflict graph whose vertices correspond
Ulrich Pferschy, Joachim Schauer
doaj +1 more source
The complexity of two graph orientation problems [PDF]
, 2012 This is the post-print version of the Article. The official published version can be accessed from the link below - Copyright @ 2012 ElsevierWe consider two orientation problems in a graph, namely the minimization of the sum of all the shortest path ...
Noble, Steven D. +7 more
core +1 more source
The parallel solution of domination problems on chordal and strongly chordal graphs [PDF]
, 1994 We present efficient parallel algorithms for the domination problem on strongly chordal graphs and related problems, such as the set cover problem for α-acyclic hypergraphs and the dominating clique problem for strongly chordal graphs.
Damaschke, Peter, Dahlhaus, Elias
core +1 more source
Advanced Functional Materials, EarlyView.This study presents a magneto‐mechanical strategy that incorporates FP@MSCs into an aligned PCL/GelMA nerve guidance conduit. Magnetic stimulation increases membrane tension in FP@MSCs, triggering cytoskeletal remodeling, Schwann cell‐like differentiation, and TIMP1 secretion. TIMP1 activates ITGB1/CD63–FAK signaling in NE‐4C cells, increasing membrane
Xinyu Zhu +14 more
wiley +1 more source
Advanced Science, EarlyView.The pre‐regenerative vascular niche (PVN) is essential for nerve repair, yet its endothelial blueprint remains unclear. We identified angiogenic ECs (AECs) as the dominant pre‐regenerative subset and found that antler blood–derived exosomes (AB‐EXO) promote repair via IMP3.
Jinsheng Huang +11 more
wiley +1 more source
A characterization of chordal graph without sun and co-rising sun as convex geometry
Theory and Applications of GraphsIn this paper we introduce the notion of $t_3$ \textit{convexity}, a natural restriction of triangle convexity. A \textit{triangle path} is a path allowing just short chords. A triangle path $P$ between two non-adjacent vertices in a graph $G$ is called $
Silvia B. Tondato
doaj +1 more source