Results 211 to 220 of about 5,532 (307)

A Coarse Geometric Approach to Graph Layout Problems

Journal of Graph Theory, EarlyView.
ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang, David Hume, Samuel J. Kelly, Ryan Lam   +3 more
wiley   +1 more source

A first order method for linear programming parameterized by circuit imbalance. [PDF]

Math Program
Cole R, Hertrich C, Tao Y, Végh LA.
europepmc   +1 more source

On a Clique‐Building Game of Erdős

Journal of Graph Theory, EarlyView.
ABSTRACT The following game was introduced in a list of open problems from 1983 attributed to Erdős: two players take turns claiming edges of a Kn ${K}_{n}$ until all edges are exhausted. Player 1 wins the game if the largest clique that they claim at the end is strictly larger than the largest clique of their opponent; otherwise, Player 2 wins the ...
Alexandru Malekshahian, Sam Spiro
wiley   +1 more source

Optimal Multi-Drug Therapies for Antimicrobial Resistance with Horizontal Transfer. [PDF]

J Optim Theory Appl
Campana FC, Incremona GP, Blanchini F, Colaneri P, Giordano G.   +4 more
europepmc   +1 more source

Weak Degeneracy of Planar Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT The weak degeneracy of a graph G $G$ is a numerical parameter that was recently introduced by the first two authors with the aim of understanding the power of greedy algorithms for graph coloring. Every d $d$‐degenerate graph is weakly d $d$‐degenerate, but the converse is not true in general (e.g., all connected d $d$‐regular graphs except ...
Anton Bernshteyn, Eugene Lee, Evelyne Smith‐Roberge   +2 more
wiley   +1 more source

Linear Versus Centred Colouring via Pseudogrids

Journal of Graph Theory, EarlyView.
ABSTRACT A centred colouring of a graph is a vertex colouring in which every connected subgraph contains a vertex whose colour is unique and a linear colouring is a vertex colouring in which every (not‐necessarily induced) path contains a vertex whose colour is unique. For a graph G $G$, the centred chromatic number χ cen ( G ) ${\chi }_{\text{cen}}(G)$
Prosenjit Bose, Vida Dujmović, Hussein Houdrouge, Mehrnoosh Javarsineh, Pat Morin   +4 more
wiley   +1 more source

Multi-stage bidirectional informed-RRT * plant protection UAV path planning method based on A * algorithm domain guidance. [PDF]

Front Plant Sci
Li J, Gao Y, Li Z, Zhang W, Yu W, Hu Y, Liu H, Li C.   +7 more
europepmc   +1 more source

Density Conditions for k $k$ Vertex‐Disjoint Triangles in Tripartite Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT Let n , k $n,k$ be positive integers such that n ≥ k $n\ge k$ and G $G$ be a tripartite graph with parts A , B , C $A,B,C$ such that ∣ A ∣ = ∣ B ∣ = ∣ C ∣ = n $| A| =| B| =| C| =n$. Denote the edge densities of G [ A , B ] , G [ A , C ] $G[A,B],G[A,C]$ and G [ B , C ] $G[B,C]$ by α , β $\alpha ,\beta $ and γ $\gamma $, respectively.
Mingyang Guo, Klas Markström
wiley   +1 more source

Metabolic Saliency as KL-Divergence Estimator: Information-Geometric Attribution of Systemic Stress in JSE Equity Network. [PDF]

Entropy (Basel)
Moroke ND.
europepmc   +1 more source

Spreading quality improvement in bronchiolitis care: A qualitative study of barriers and facilitators to de‐implementation efforts across Alberta′s healthcare settings

Journal of Hospital Medicine, EarlyView.
Abstract Background Low‐value care remains prevalent in bronchiolitis management despite evidence‐based guidelines. De‐implementation initiatives face unique challenges compared with traditional implementation efforts, particularly when spreading across diverse healthcare settings.
Nathan M. Solbak, Ashleigh Jensen, Erin Thompson, Aaron Peterson, Lily Ragan, Daina Thomas, David W. Johnson, J. A. Michelle Bailey   +7 more
wiley   +1 more source