Results 91 to 100 of about 84,087 (307)
Facial graceful coloring of plane graphs [PDF]
Let \(G\) be a plane graph. Two edges of \(G\) are facially adjacent if they are consecutive on the boundary walk of a face of \(G\). A facial edge coloring of \(G\) is an edge coloring such that any two facially adjacent edges receive different colors ...
Július Czap
doaj +1 more source
Objective The goal was to assess the diagnostic performance of three novel autoantibodies (NA) for Sjögren's disease (SjD) by comparing NA prevalence in patients with SjD, other autoimmune rheumatic diseases (ARDs), nonspecific chronic sialadenitis (CS), and controls.
Chadwick R. Johr +5 more
wiley +1 more source
Channel Selection in Uncoordinated IEEE 802.11 Networks Using Graph Coloring. [PDF]
Gimenez-Guzman JM +4 more
europepmc +1 more source
Workflow of the parameter optimization process for ITSC fault detection, applying Differential Evolution optimization and the Smooth Pseudo Wigner‐Ville Distribution for signal processing. The optimized parameters are then used in the failure identification pipeline, which combines the signal processing with a YOLO‐based architecture for fault severity
Rafael Martini Silva +4 more
wiley +1 more source
THE LOCATING RAINBOW CONNECTION NUMBERS OF LOLLIPOP AND BARBELL GRAPHS
The concept of the locating rainbow connection number of a graph is an innovation in graph coloring theory that combines the concepts of rainbow vertex coloring and partition dimension on graphs.
Ariestha Widyastuty Bustan +4 more
doaj +1 more source
Online Graph Coloring for $k$-Colorable Graphs
We study the problem of online graph coloring for $k$-colorable graphs. The best previously known deterministic algorithm uses $\tilde{O}(n^{1-1/k!})$ colors for general $k$ and $\tilde{O}(n^{5/6})$ colors for $k = 4$, both given by Kierstead in 1998. In this paper, nearly thirty years later, we have finally made progress. Our results are summarized as
Kawarabayashi, Ken-ichi +2 more
openaire +2 more sources
Data‐Driven Distributed Safe Control Design for Multi‐Agent Systems
This paper presents a data‐driven control barrier function (CBF) technique for ensuring safe control of multi‐agent systems (MASs) with uncertain linear dynamics. A data‐driven quadratic programming (QP) optimization is first developed for CBF‐based safe control of single‐agent systems using a nonlinear controller. This approach is then extended to the
Marjan Khaledi, Bahare Kiumarsi
wiley +1 more source
Joint User Clustering and Graph Coloring Based Pilot Assignment for Cell-Free Massive MIMO Systems. [PDF]
Huang X, Wang Y, Chen S, Li Y, Wu Y.
europepmc +1 more source
Local Antimagic Vertex Coloring of Corona Product Graphs Pn ∘ Pk [PDF]
Setiawan Setiawan, Kiki Ariyanti Sugeng
openalex +1 more source
Laser Metal Deposited Ti4822 Hollow Pipe: Experimental and Computational Modelling Study
Laser metal deposition (LMD) of a crack‐free built Ti4822 alloys is challenging. This article reports outstanding characteristics of a hollow pipe that is built with LMD technology when a predicted, nontransformation substrate temperature of 800 °C is used.
Sadiq A. Raji +5 more
wiley +1 more source

