Results 1 to 10 of about 2,126 (197)
Optimized fiducial marker placement using B‐spline surface modeling and graph theory for Cyberknife stereotactic body radiotherapy for superficial tumors [PDF]
Precision Radiation OncologyCyberKnife, an established noninvasive stereotactic radiotherapy technology, has been extensively utilized to treat various malignancies because of its high precision and conformal dose delivery. The success of CyberKnife treatment is crucially dependent
Jing Huang +5 more
doaj +2 more sources
Computing the Atom Graph of a Graph and the Union Join Graph of a Hypergraph
Algorithms, 2021 The atom graph of a graph is a graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all possible atom trees of this graph.
Anne Berry, Geneviève Simonet
doaj +1 more source
Properties and Recognition of Atom Graphs
Algorithms, 2022 The atom graph of a connected graph is a graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all its atom trees.
Geneviève Simonet, Anne Berry
doaj +1 more source
Mathematics, 2021 Let G be a graph of order n. If the maximal connected subgraph of G has no cut vertex then it is called a block. If each block of graph G is a clique then G is called clique tree.
Shaowei Sun +2 more
doaj +1 more source
The Neighborhood Polynomial of Chordal Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 We study the neighborhood polynomial and the complexity of its computation for chordal graphs. The neighborhood polynomial of a graph is the generating function of subsets of its vertices that have a common neighbor.
Helena Bergold +2 more
doaj +1 more source
A FFT-Like MIMO Detection Algorithm
IEEE Access, 2020 This paper studies the multiple-input-multiple-output (MIMO) detection problem. Existing works model the MIMO detection as a tree or factor graph. This work adds a new member called the clique graph model to the MIMO detection graph model family so that ...
Peng Du, Yuan Zhang, Teer Ba
doaj +1 more source
On Weakly Distinguishing Graph Polynomials [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A univariate graph polynomial P(G;X) is weakly distinguishing if for almost all finite graphs G there is a finite graph H with P(G;X)=P(H;X). We show that the clique polynomial and the independence polynomial are weakly distinguishing.
Johann A. Makowsky, Vsevolod Rakita
doaj +1 more source
Tropical Graph Parameters [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Connection matrices for graph parameters with values in a field have been introduced by M. Freedman, L. Lovász and A. Schrijver (2007). Graph parameters with connection matrices of finite rank can be computed in polynomial time on graph classes of ...
Nadia Labai, Johann Makowsky
doaj +1 more source
Mind the
Algorithms, 2023 We present two algorithms in the quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability: one for producing an approximately optimal Steiner tree, and one for producing an exact directed minimum spanning tree, each of ...
Phillip Kerger +3 more
doaj +1 more source
Using Machine Learning for Quantum Annealing Accuracy Prediction
Algorithms, 2021 Quantum annealers, such as the device built by D-Wave Systems, Inc., offer a way to compute solutions of NP-hard problems that can be expressed in Ising or quadratic unconstrained binary optimization (QUBO) form.
Aaron Barbosa +3 more
doaj +1 more source