Results 61 to 70 of about 2,084 (327)

Dual Connectivity in Graphs

Mathematics
An edge-coloring σ of a connected graph G is called rainbow if there exists a rainbow path connecting any pair of vertices. In contrast, σ is monochromatic if there is a monochromatic path between any two vertices.
Mohammed A. Mutar, Daniele Ettore Otera, Hasan A. Khawwan   +2 more
doaj   +1 more source

Deep Learning‐Assisted Coherent Raman Scattering Microscopy

Advanced Intelligent Discovery, EarlyView.
The analytical capabilities of coherent Raman scattering microscopy are augmented through deep learning integration. This synergistic paradigm improves fundamental performance via denoising, deconvolution, and hyperspectral unmixing. Concurrently, it enhances downstream image analysis including subcellular localization, virtual staining, and clinical ...
Jianlin Liu, Rujia Liu, Xinyan Zhang, Xun Chen, Shuhua Yue   +4 more
wiley   +1 more source

Rainbow Perfect and Near-Perfect Matchings in Complete Graphs with Edges Colored by Circular Distance

Theory and Applications of Graphs, 2022
Given an edge-colored complete graph Kn on n vertices, a perfect (respectively, near-perfect) matching M in Kn with an even (respectively, odd) number of vertices is rainbow if all edges have distinct colors.
Shuhei Saitoh, Naoki Matsumoto, Wei Wu
doaj   +1 more source

Algorithms and Bounds for Very Strong Rainbow Coloring [PDF]

, 2018
A well-studied coloring problem is to assign colors to the edges of a graph G so that, for every pair of vertices, all edges of at least one shortest path between them receive different colors. The minimum number of colors necessary in such a coloring is
van Leeuwen, E., Chandran, Sunil L, Das, A., van Leeuwen, Erik Jan, Mosteiro, Miguel A., Chandran, L. Sunil, Chandran, L., Bender, Michael A., Farach-Colton, Martin, Issac, D., Erik Jan van Leeuwen, Leeuwen, Erik Jan van, Davis Issac, Das, Anita, Anita Das, Issac, Davis, Sub Algorithms and Complexity, L. Sunil Chandran, Algorithms and Complexity   +18 more
core   +1 more source

Human‐in‐the‐Loop Object Segmentation for 3D Gaussian Splatting via Finger‐based VR Interface

Advanced Intelligent Systems, EarlyView.
This study introduces a human‐in‐the‐loop segmentation framework for 3D Gaussian Splatting that integrates real‐time optimization with intuitive VR‐based finger prompting. Compared with existing automatic, learning‐based methods, it achieves significantly higher accuracy and reduced segmentation time.
Yongseok Lee, Hyunreal Park, Hyunsu Kim, Harim Ji, Dongho Yee, Dongjun Lee   +5 more
wiley   +1 more source

Worm Colorings

Discussiones Mathematicae Graph Theory, 2015
Given a coloring of the vertices, we say subgraph H is monochromatic if every vertex of H is assigned the same color, and rainbow if no pair of vertices of H are assigned the same color. Given a graph G and a graph F, we define an F-WORM coloring of G as
Goddard Wayne, Wash Kirsti, Xu Honghai
doaj   +1 more source

Bilangan Terhubung Titik Pelangi pada Graf Hasil Operasi Korona Graf Prisma (P_(m,2)) dan Graf Lintasan (P_3)

Jambura Journal of Mathematics, 2022
Rainbow vertex-connection number is the minimum k-coloring on the vertex graph G and is denoted by rvc(G). Besides, the rainbow-vertex connection number can be applied to some special graphs, such as prism graph and path graph.
Indrawati Lihawa, Sumarno Ismail, Isran K Hasan, Lailany Yahya, Salmun K Nasib, Nisky Imansyah Yahya   +5 more
doaj   +1 more source

Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs [PDF]

, 2018
Given a graph with colors on its vertices, a path is called a rainbow vertex path if all its internal vertices have distinct colors. We say that the graph is rainbow vertex-connected if there is a rainbow vertex path between every pair of its vertices ...
van Leeuwen, E., van Leeuwen, Erik Jan, Worrell, James, Issac, D., Leeuwen, Erik Jan van, Lauri, J., Lima, Paloma T., Lima, P., Lauri, Juho, Heggernes, P., Heggernes, Pinar, Spirakis, Paul, Issac, Davis, Potapov, Igor, Sub Algorithms and Complexity, Algorithms and Complexity   +15 more
core   +1 more source

Longitudinal Modulation of the Gut Microbiome and Growth Performance by Phytochemicals as Antibiotic Alternatives in Swine Production

Animal Research and One Health, EarlyView.
We conducted a longitudinal trial across nursery, growing, and finishing phases, showing that phytochemical supplementation as a potential antibiotic alternative reduced potential pathogens and promoted beneficial Lactobacillus amylovorus in the nursery phase, and enriched amino acid and carbohydrate metabolism pathways (prediction) during finishing ...
Ziyu Liu, Samantha Howe, Yang Tian, Alisun N. Watson, Jason E. Farrar, Christopher E. Randolph, Jaime Andrés Ángel Isaza, Álvaro José Uribe, Yan Huang, Michael Looper, Jiangchao Zhao, Tsungcheng Tsai   +11 more
wiley   +1 more source

The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths

Electronic Journal of Graph Theory and Applications, 2020
An edge-colored graph G is rainbow k-connected, if there are k-internally disjoint rainbow paths connecting every pair of vertices of G. The rainbow k-connection number of G, denoted by rck(G), is the minimum number of colors needed for which there ...
Bety Hayat Susanti, A.N.M. Salman, Rinovia Simanjuntak   +2 more
doaj   +1 more source