Results 111 to 120 of about 2,563,850 (352)
Graphs with at most two moplexes [PDF]
arXiv, 2021 A moplex is a natural graph structure that arises when lifting Dirac's classical theorem from chordal graphs to general graphs. While every non-complete graph has at least two moplexes, little is known about structural properties of graphs with a bounded number of moplexes.
arxiv
Journal of Applied Clinical Medical Physics, EarlyView.Abstract Purpose This work introduces BreastWatch, a Varian Eclipse script tool designed to help medical physicists, dosimetrists, and radiation oncologists easily inspect and improve External Beam Breast Treatment (EBBT) plans using automatic evaluation of protocol dose‐constraints enhanced by a Community‐Based approach.
Stefano Agostinelli +8 more
wiley +1 more source
Eccentricity based topological indices of face centered cubic lattice FCC(n)
Main Group Metal Chemistry, 2021 Chemical graph theory has become a prime gadget for mathematical chemistry due to its wide range of graph theoretical applications for solving molecular problems.
Shaker Hani +2 more
doaj +1 more source
Journal of Applied Clinical Medical Physics, EarlyView.Abstract Purpose To assess the predictive capability of CT radiomics features for early recurrence (ER) of pancreatic ductal adenocarcinoma (PDAC). Methods Postoperative PDAC patients were retrospectively selected, all of whom had undergone preoperative CT imaging and surgery. Both patients with resectable or borderline‐resectable pancreatic cancer met
Xinze Du +7 more
wiley +1 more source
Cohen Macaulay Hybrid Graphs [PDF]
arXiv, 2019 We introduce a new family of graphs, namely, hybrid graphs. There are infinitely many hybrid graphs associated to a single graph. We show that every hybrid graph associated to a given graph is Cohen Macaulay. Furthermore, we show that every CohenMacaulay chordal graph is a hybrid graph.
arxiv
Mercem: Method Name Recommendation Based on Call Graph Embedding [PDF]
2019 26th Asia-Pacific Software Engineering Conference (APSEC), 2019 Comprehensibility of source code is strongly affected by identifier names, therefore software developers need to give good (e.g. meaningful but short) names to identifiers. On the other hand, giving a good name is sometimes a difficult and time-consuming task even for experienced developers.
Hiroshi Yonai +2 more
openaire +3 more sources
Universal Proteomic Signature After Exercise‐Induced Muscle Injury in Muscular Dystrophies
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Several neuromuscular disorders (NMDs) are characterized by progressive muscle damage and are marked by the elevation of circulating muscle proteins from activity‐related injury. Despite a diverse array of genetic drivers, many NMDs share similar patterns of exercise intolerance and higher concentrations of muscle injury proteins ...
Mads G. Stemmerik +5 more
wiley +1 more source
Stability of Special Graph Classes [PDF]
arXiv, 2021 Frei et al. [6] showed that the problem to decide whether a graph is stable with respect to some graph parameter under adding or removing either edges or vertices is $\Theta_2^{\text{P}}$-complete. They studied the common graph parameters $\alpha$ (independence number), $\beta$ (vertex cover number), $\omega$ (clique number), and $\chi$ (chromatic ...
arxiv
Light‐Triggered Protease‐Mediated Release of Actin‐Bound Cargo from Synthetic Cells
Advanced Biology, EarlyView.TEV Prtoease‐mediated Releasable Actin‐binding Protein (TRAP) is a protein‐based platform consisting of a cargo tightly bound to reconstituted actin networks in synthetic cells which can be proteolyticly released from the bound actin, followed by its secretion through membrane translocation mediated by a cell‐penetrating peptide.
Mousumi Akter +3 more
wiley +1 more source
On vertex, edge, and vertex-edge random graphs [PDF]
arXiv, 2008 We consider three classes of random graphs: edge random graphs, vertex random graphs, and vertex-edge random graphs. Edge random graphs are Erdos-Renyi random graphs, vertex random graphs are generalizations of geometric random graphs, and vertex-edge random graphs generalize both.
arxiv