Log in

Relevant bibliographies by topics / CORE VERTEX / Journal articles

To see the other types of publications on this topic, follow the link: CORE VERTEX.

Journal articles on the topic 'CORE VERTEX'

Author: Grafiati

Published: 11 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'CORE VERTEX.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Fang, Qizhi, Liang Kong, and Jia Zhao. "Core Stability of Vertex Cover Games." Internet Mathematics 5, no. 4 (2008): 383–94. http://dx.doi.org/10.1080/15427951.2008.10129174.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Wu, Tongsuo, Meng Ye, Dancheng Lu, and Houyi Yu. "On Graphs Related to Comaximal Ideals of a Commutative Ring." ISRN Combinatorics 2013 (February 19, 2013): 1–7. http://dx.doi.org/10.1155/2013/354696.

Full text

Abstract:

We study the co maximal graph Ω(R), the induced subgraph Γ(R) of Ω(R) whose vertex set is R∖(U(R)∪J(R)), and a retract Γr(R) of Γ(R), where R is a commutative ring. For a graph Γ(R) which contains a cycle, we show that the core of Γ(R) is a union of triangles and rectangles, while a vertex in Γ(R) is either an end vertex or a vertex in the core. For a nonlocal ring R, we prove that both the chromatic number and clique number of Γ(R) are identical with the number of maximal ideals of R. A graph Γr(R) is also introduced on the vertex set {Rx∣x∈R∖(U(R)∪J(R))}, and graph properties of Γr(R) are st

APA, Harvard, Vancouver, ISO, and other styles

3

Green, D. G., and G. F. Gribakin. "Vertex enhancement of positron annihilation with core electrons." Journal of Physics: Conference Series 388, no. 7 (2012): 072018. http://dx.doi.org/10.1088/1742-6596/388/7/072018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

P., Arun Kumar, and E. Rathakrishnan. "Triangular tabs for supersonic jet mixing enhancement." Aeronautical Journal 118, no. 1209 (2014): 1245–78. http://dx.doi.org/10.1017/s0001924000009969.

Full text

Abstract:

AbstractThe mixing promoting capability of right-angled triangular tab with sharp and truncated vertex has been investigated by placing two identical tabs at the exit of a Mach 2 axi-symmetric nozzle. The mixing promoting efficiency of these tabs have been quantified in the presence of adverse and marginally favourable pressure gradients at the nozzle exit. It was found that, at all levels of expansion of the present study though the core length reduction caused by both the tabs are appreciable, but the mixing caused by the truncated tab is superior. The mixing promoting efficiency of the trun

APA, Harvard, Vancouver, ISO, and other styles

5

Feng, Xiangnan, Wei Wei, Xing Li, and Zhiming Zheng. "Core influence mechanism on vertex-cover problem through leaf-removal-core breaking." Journal of Statistical Mechanics: Theory and Experiment 2019, no. 7 (2019): 073401. http://dx.doi.org/10.1088/1742-5468/ab25e1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

CUCURINGU, MIHAI, PUCK ROMBACH, SANG HOON LEE, and MASON A. PORTER. "Detection of core–periphery structure in networks using spectral methods and geodesic paths." European Journal of Applied Mathematics 27, no. 6 (2016): 846–87. http://dx.doi.org/10.1017/s095679251600022x.

Full text

Abstract:

We introduce several novel and computationally efficient methods for detecting “core–periphery structure” in networks. Core–periphery structure is a type of mesoscale structure that consists of densely connected core vertices and sparsely connected peripheral vertices. Core vertices tend to be well-connected both among themselves and to peripheral vertices, which tend not to be well-connected to other vertices. Our first method, which is based on transportation in networks, aggregates information from many geodesic paths in a network and yields a score for each vertex that reflects the likelih

APA, Harvard, Vancouver, ISO, and other styles

7

Zhao, Jianwen, and Yufei Tao. "Minimum vertex augmentation." Proceedings of the VLDB Endowment 14, no. 9 (2021): 1454–66. http://dx.doi.org/10.14778/3461535.3461536.

Full text

Abstract:

This paper introduces a class of graph problems named minimum vertex augmentation (MVA). Given an input graph G where each vertex carries a binary color 0 or 1, we want to flip the colors of the fewest 0-vertices such that the subgraph induced by all the (original and new) 1-vertices satisfies a user-defined predicate π. In other words, the goal is to minimally augment the subset of 1-vertices to uphold the property π. Different formulations of π instantiate the framework into concrete problems at the core of numerous applications. We first describe a suite of techniques for solving MVA proble

APA, Harvard, Vancouver, ISO, and other styles

8

Bachrach, Y., E. Porat, and J. S. Rosenschein. "Sharing Rewards in Cooperative Connectivity Games." Journal of Artificial Intelligence Research 47 (June 14, 2013): 281–311. http://dx.doi.org/10.1613/jair.3841.

Full text

Abstract:

We consider how selfish agents are likely to share revenues derived from maintaining connectivity between important network servers. We model a network where a failure of one node may disrupt communication between other nodes as a cooperative game called the vertex Connectivity Game (CG). In this game, each agent owns a vertex, and controls all the edges going to and from that vertex. A coalition of agents wins if it fully connects a certain subset of vertices in the graph, called the primary vertices. Power indices measure an agent's ability to affect the outcome of the game. We show that in

APA, Harvard, Vancouver, ISO, and other styles

9

Dong, Zheng, Xin Huang, Guorui Yuan, Hengshu Zhu, and Hui Xiong. "Butterfly-core community search over labeled graphs." Proceedings of the VLDB Endowment 14, no. 11 (2021): 2006–18. http://dx.doi.org/10.14778/3476249.3476258.

Full text

Abstract:

Community search aims at finding densely connected subgraphs for query vertices in a graph. While this task has been studied widely in the literature, most of the existing works only focus on finding homogeneous communities rather than heterogeneous communities with different labels. In this paper, we motivate a new problem of cross-group community search, namely Butterfly-Core Community (BCC), over a labeled graph, where each vertex has a label indicating its properties and an edge between two vertices indicates their cross relationship. Specifically, for two query vertices with different lab

APA, Harvard, Vancouver, ISO, and other styles

10

McCrabb, Andrew, and Valeria Bertacco. "Optimizing Vertex Pressure Dynamic Graph Partitioning in Many-Core Systems." IEEE Transactions on Computers 70, no. 6 (2021): 936–49. http://dx.doi.org/10.1109/tc.2021.3059386.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

He, Xiaocong, Lihua Feng, and Dragan Stevanović. "The maximum spectral radius of graphs with a large core." Electronic Journal of Linear Algebra 39 (February 24, 2023): 78–89. http://dx.doi.org/10.13001/ela.2023.7283.

Full text

Abstract:

The $(k+1)$-core of a graph $G$, denoted by $C_{k+1}(G)$, is the subgraph obtained by repeatedly removing any vertex of degree less than or equal to $k$. $C_{k+1}(G)$ is the unique induced subgraph of minimum degree larger than $k$ with a maximum number of vertices. For $1\leq k\leq m\leq n$, we denote $R_{n, k, m}=K_k\vee(K_{m-k}\cup {I_{n-m}})$. In this paper, we prove that $R_{n, k, m}$ obtains the maximum spectral radius and signless Laplacian spectral radius among all $n$-vertex graphs whose $(k+1)$-core has at most $m$ vertices. Our result extends a recent theorem proved by Nikiforov [El

APA, Harvard, Vancouver, ISO, and other styles

12

CARO, YAIR, and RAPHAEL YUSTER. "Dominating a Family of Graphs with Small Connected Subgraphs." Combinatorics, Probability and Computing 9, no. 4 (2000): 309–13. http://dx.doi.org/10.1017/s0963548300004260.

Full text

Abstract:

Let F = {G1, …, Gt} be a family of n-vertex graphs defined on the same vertex-set V, and let k be a positive integer. A subset of vertices D ⊂ V is called an (F, k)-core if, for each v ∈ V and for each i = 1, …, t, there are at least k neighbours of v in Gi that belong to D. The subset D is called a connected (F, k)-core if the subgraph induced by D in each Gi is connected. Let δi be the minimum degree of Gi and let δ(F) = minti=1δi. Clearly, an (F, k)-core exists if and only if δ(F) [ges ] k, and a connected (F, k)-core exists if and only if δ(F) [ges ] k and each Gi is connected. Let c(k, F)

APA, Harvard, Vancouver, ISO, and other styles

13

Botea, Adi, Massimiliano Mattetti, Akihiro Kishimoto, Radu Marinescu, and Elizabeth Daly. "Counting Vertex-Disjoint Shortest Paths in Graphs." Proceedings of the International Symposium on Combinatorial Search 12, no. 1 (2021): 28–36. http://dx.doi.org/10.1609/socs.v12i1.18548.

Full text

Abstract:

Finding a shortest path in a graph is at the core of many combinatorial search problems. A closely related problem refers to counting the number of shortest paths between two nodes. Such problems are solvable in polynomial time in the size of the graph. However, more realistic problem formulations could additionally specify constraints to satisfy. We study the problem of counting the shortest paths that are vertex disjoint and can satisfy additional constraints. Specifically, we look at the problems of counting vertex-disjoint shortest paths in edge-colored graphs, counting vertex-disjoint sho

APA, Harvard, Vancouver, ISO, and other styles

14

CAMERON, PETER J., and PRISCILA A. KAZANIDIS. "CORES OF SYMMETRIC GRAPHS." Journal of the Australian Mathematical Society 85, no. 2 (2008): 145–54. http://dx.doi.org/10.1017/s1446788708000815.

Full text

Abstract:

AbstractThe core of a graph Γ is the smallest graph Δ that is homomorphically equivalent to Γ (that is, there exist homomorphisms in both directions). The core of Γ is unique up to isomorphism and is an induced subgraph of Γ. We give a construction in some sense dual to the core. The hull of a graph Γ is a graph containing Γ as a spanning subgraph, admitting all the endomorphisms of Γ, and having as core a complete graph of the same order as the core of Γ. This construction is related to the notion of a synchronizing permutation group, which arises in semigroup theory; we provide some more ins

APA, Harvard, Vancouver, ISO, and other styles

15

Hoepfner, K., and W. Schmidt-Parzefall. "Application of liquid-core fibres for a radiation-hard vertex detector." Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment 440, no. 1 (2000): 46–56. http://dx.doi.org/10.1016/s0168-9002(99)00883-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Liu, Qing, Xuliang Zhu, Xin Huang, and Jianliang Xu. "Local algorithms for distance-generalized core decomposition over large dynamic graphs." Proceedings of the VLDB Endowment 14, no. 9 (2021): 1531–43. http://dx.doi.org/10.14778/3461535.3461542.

Full text

Abstract:

The distance-generalized core, also called ( k , h )-core, is defined as the maximal subgraph in which every vertex has at least k vertices at distance no longer than h. Compared with k -core, ( k , h )-core can identify more fine-grained subgraphs and, hence, is more useful for the applications such as network analysis and graph coloring. The state-of-the-art algorithms for ( k , h )-core decomposition are peeling algorithms, which iteratively delete the vertex with the minimum h -degree (i.e., the least number of neighbors within h hops). However, they suffer from some limitations, such as l

APA, Harvard, Vancouver, ISO, and other styles

17

Liao, Xuankun, Qing Liu, Jiaxin Jiang, Xin Huang, Jianliang Xu, and Byron Choi. "Distributed D-core decomposition over large directed graphs." Proceedings of the VLDB Endowment 15, no. 8 (2022): 1546–58. http://dx.doi.org/10.14778/3529337.3529340.

Full text

Abstract:

Given a directed graph G and integers k and l , a D-core is the maximal subgraph H ⊆ G such that for every vertex of H , its in-degree and out-degree are no smaller than k and l , respectively. For a directed graph G , the problem of D-core decomposition aims to compute the non-empty D-cores for all possible values of k and l. In the literature, several peeling-based algorithms have been proposed to handle D-core decomposition. However, the peeling-based algorithms that work in a sequential fashion and require global graph information during processing are mainly designed for centralized setti

APA, Harvard, Vancouver, ISO, and other styles

18

Wang, Xingyuan, and Junqiu Li. "Detecting communities by the core-vertex and intimate degree in complex networks." Physica A: Statistical Mechanics and its Applications 392, no. 10 (2013): 2555–63. http://dx.doi.org/10.1016/j.physa.2013.01.039.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Orlosky‐Novack, Jennifer A., and Susan M. Kline. "Nulliparous, Term, Singleton, Vertex Cesarean, Oh My! Deciphering the Perinatal Core Measures." Journal of Obstetric, Gynecologic & Neonatal Nursing 42 (June 2013): S54—S55. http://dx.doi.org/10.1111/1552-6909.12130.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Holme, Petter, Josh Karlin, and Stephanie Forrest. "Radial structure of the Internet." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 463, no. 2081 (2007): 1231–46. http://dx.doi.org/10.1098/rspa.2007.1820.

Full text

Abstract:

The structure of the Internet at the autonomous system (AS) level has been studied by the physics, mathematics and computer science communities. We extend this work to include features of the core and the periphery, taking a radial perspective on AS network structure. New methods for plotting AS data are described, and they are used to analyse datasets that have been extended to contain edges missing from earlier collections. The average distance from one vertex to the rest of the network is used as the baseline metric for investigating radial structure. Common vertex-specific quantities are p

APA, Harvard, Vancouver, ISO, and other styles

21

Anwar, Muhammad, Aboul Ella Hassanien, Václav Snás̃el, and Sameh H. Basha. "Subgraph Query Matching in Multi-Graphs Based on Node Embedding." Mathematics 10, no. 24 (2022): 4830. http://dx.doi.org/10.3390/math10244830.

Full text

Abstract:

This paper presents an efficient algorithm for matching subgraph queries in a multi-graph based on features-based indexing techniques. The KD-tree data structure represents these nodes’ features, while the set-trie index data structure represents the multi-edges to make queries effectively. The vertex core number, triangle number, and vertex degree are the eight features’ main features. The densest vertex in the query graph is extracted based on these main features. The proposed model consists of two phases. The first phase’s main idea is that, for the densest extracted vertex in the query gra

APA, Harvard, Vancouver, ISO, and other styles

22

Nasihatgozar, M., and SMR Khalili. "Vibration and buckling analysis of laminated sandwich conical shells using higher order shear deformation theory and differential quadrature method." Journal of Sandwich Structures & Materials 21, no. 4 (2017): 1445–80. http://dx.doi.org/10.1177/1099636217715806.

Full text

Abstract:

Vibration and buckling analysis of laminated sandwich truncated conical shells with compressible or incompressible core are presented in this work considering curvature effects. The formulation uses the quadratic and cubic functions for transverse and in-plane displacements of the core and the first-order shear deformation theory for the face sheets. The motion equations of each individual layer are derived according to the principle of minimum total potential energy considering the continuity of the displacements and the internal stress fields at the interfaces. Differential quadrature method

APA, Harvard, Vancouver, ISO, and other styles

23

Matsuo, Shota, Seiji Yamazoe, Jing-Qiang Goh, Jaakko Akola, and Tatsuya Tsukuda. "The electrooxidation-induced structural changes of gold di-superatomic molecules: Au23vs. Au25." Physical Chemistry Chemical Physics 18, no. 6 (2016): 4822–27. http://dx.doi.org/10.1039/c5cp06969f.

Full text

Abstract:

Face-sharing bi-icosahedral Au<sub>23</sub> core of Au<sub>38</sub>(SC<sub>2</sub>H<sub>4</sub>Ph)<sub>24</sub> retained its structure, whereas vertex-sharing bi-icosahedral Au<sub>25</sub> core of [Au<sub>25</sub>(PPh<sub>3</sub>)<sub>10</sub>(SC<sub>2</sub>H<sub>4</sub>Ph)<sub>5</sub>Cl<sub>2</sub>]<sup>2+</sup> underwent irreversible structural change upon electrooxidation.

APA, Harvard, Vancouver, ISO, and other styles

24

M R, Mr Rakesh. "Design and Implementation of Dual Core and Quad Core Processor in Vertex 6 FPGA Using Pipelined RISC Architecture." IJIREEICE 6, no. 11 (2018): 22–28. http://dx.doi.org/10.17148/ijireeice.2018.6114.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Alinejad, M., and A. Erfanian. "Vertex and edge connectivity of non-normal graphs." Journal of Algebra and Its Applications 15, no. 06 (2016): 1650118. http://dx.doi.org/10.1142/s0219498816501188.

Full text

Abstract:

Let [Formula: see text] be a finite group and [Formula: see text] be a subgroup of [Formula: see text]. The non-normal graph of [Formula: see text] in [Formula: see text], denoted by [Formula: see text], is defined as the bipartite graph with two parts [Formula: see text] and [Formula: see text], where [Formula: see text] and [Formula: see text] are the normalizer and the core of [Formula: see text] in [Formula: see text], respectively. Two vertices [Formula: see text] and [Formula: see text] are adjacent if [Formula: see text]. In this paper, we consider vertex and edge connectivity of [Formu

APA, Harvard, Vancouver, ISO, and other styles

26

Rakityansky, S. A., та I. M. Gopane. "Effective-range parameters and vertex constants for Λ-nuclear systems". International Journal of Modern Physics E 26, № 04 (2017): 1750014. http://dx.doi.org/10.1142/s0218301317500148.

Full text

Abstract:

For a wide range of the core-nuclei ([Formula: see text]), the scattering lengths, effective radii, and the other effective-range parameters (up to the order [Formula: see text]) for the angular momentum [Formula: see text] are calculated within a two-body [Formula: see text]-model. For the same hypernuclear systems, the [Formula: see text]-matrix residues as well as the corresponding Nuclear-Vertex and Asymptotic-Normalization constants (NVC’s and ANC’s) for the bound states are also found.

APA, Harvard, Vancouver, ISO, and other styles

27

Gozzini, Francesco. "A high-performance code for EPRL spin foam amplitudes." Classical and Quantum Gravity 38, no. 22 (2021): 225010. http://dx.doi.org/10.1088/1361-6382/ac2b0b.

Full text

Abstract:

Abstract We present sl2cfoam-next, a high-performance software library for computing Lorentzian EPRL spin foam amplitudes. The library improves on previous codes by many orders of magnitude in single-core performance, can be parallelized on a large number of CPUs and on the GPU, and can be used interactively. We describe the techniques used in the code and provide many usage examples. As first applications, we use sl2cfoam-next to complete the numerical test of the Lorentzian single-vertex asymptotics and to confirm the presence of the ‘flatness problem’ of spin foam models in the BF and EPRL

APA, Harvard, Vancouver, ISO, and other styles

28

Yuan, Long, and Wei Xin Tian. "A Parallel Subgraph Isomorphism Algorithm on Multi-Core Platform." Applied Mechanics and Materials 513-517 (February 2014): 483–86. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.483.

Full text

Abstract:

Subgraph isomorphism is an elemental issue in graph theory. Being the NP-hard problem overall, it is suitable for developing parallel algorithm to reduce the cost time. This paper presented an efficient isomorphism algorithm based on breadth first strategy and a scheme to decompose the matching task over multi-core platforms. The algorithm sorts the vertices of the two graphs by the the degree of outedge and inedge, then adds all the vertices to the feasible pair according to the connection relations of the current vertex. All the tasks distributed among the multi-cores share the same memory.

APA, Harvard, Vancouver, ISO, and other styles

29

Langford, Steven J., and Clint P. Woodward. "Six-Sided Heptaporphyrin Array: Towards a Nano-Sized Cube." Collection of Czechoslovak Chemical Communications 69, no. 5 (2004): 996–1008. http://dx.doi.org/10.1135/cccc20040996.

Full text

Abstract:

A strategy in preparing a family of hexameric porphyrin cubes based on the interplay of Sn(IV)-O and Ru(II)-N interactions is described. In this first iteration, we have prepared the heptamer [SnIV(TPyP)·(4)2][Ru(CO)(TPP)]6 (4 = (E)-(3-(4-pyridyl)acrylate)) constituting a 5,10,15,20-tetra(4-pyridyl)porphyrin (TPyP) core and 5,10,15,20-tetraphenylporphyrin (TPP) faces and compared its formation by stepwise and "one-pot" strategies where up to nine components are assembled in a single step in a regiospecific manner. In one example, the heptamer is formed around the template [SnIV(TPyP)·(4)2] bea

APA, Harvard, Vancouver, ISO, and other styles

30

Callelero, Marcielow J., and Danilo M. Yanga. "Mobility of spin polarons with vertex corrections." International Journal of Modern Physics B 33, no. 18 (2019): 1950195. http://dx.doi.org/10.1142/s0217979219501959.

Full text

Abstract:

The mobility of holes in the spin polaron theory is discussed in this paper using a representation where holes are described as spinless fermions and spins as normal bosons. The hard-core bosonic operator is introduced through the Holstein–Primakoff transformation. Mathematically, the theory is implemented in the finite temperature (Matsubara) Green’s function method. The expressions for the zeroth-order term of the hole mobility is determined explicitly for hole occupation factor taking the form of Fermi–Dirac distribution and the classical Maxwell–Boltzmann distribution function. These are p

APA, Harvard, Vancouver, ISO, and other styles

31

Meng, Zheng, Ying Lin, Yan Kang, and Qian Yu. "A Parallel Programming Pattern Based on Directed Acyclic Graph." Applied Mechanics and Materials 303-306 (February 2013): 2165–69. http://dx.doi.org/10.4028/www.scientific.net/amm.303-306.2165.

Full text

Abstract:

With the development of computer technology, multi-core programming is now becoming hot issues. Based on directed acyclic graph, this paper gives definition of a number of executable operations and establishes a parallel programming pattern. Using verticies to represent tasks and edges to represent communication between vertex, this parallel programming pattern let the programmers easily to identify the available concurrency and expose it for use in the algorithm design. The proposed pattern can be used for large-scale static data batch processing in multi-core environments and can bring lots

APA, Harvard, Vancouver, ISO, and other styles

32

Gudmundsson, Joachim, John Pfeifer, and Martin P. Seybold. "On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance." ACM Transactions on Spatial Algorithms and Systems 9, no. 2 (2023): 1–24. http://dx.doi.org/10.1145/3587426.

Full text

Abstract:

We study the problem of sub-trajectory nearest-neighbor queries on polygonal curves under the continuous Fréchet distance. Given an n vertex trajectory P and an m vertex query trajectory Q , we seek to report a vertex-aligned sub-trajectory P ′ of P that is closest to Q , i.e., P′ must start and end on contiguous vertices of P . Since in real data P typically contains a very large number of vertices, we focus on answering queries, without restrictions on P or Q , using only precomputed structures of 𝒪(n) size. We use three baseline algorithms from straightforward extensions of known work; howe

APA, Harvard, Vancouver, ISO, and other styles

33

Requerey, Iker S., Basilio Ruiz Cobo, Milan Gošić, and Luis R. Bellot Rubio. "Persistent magnetic vortex flow at a supergranular vertex." Astronomy & Astrophysics 610 (February 2018): A84. http://dx.doi.org/10.1051/0004-6361/201731842.

Full text

Abstract:

Context. Photospheric vortex flows are thought to play a key role in the evolution of magnetic fields. Recent studies show that these swirling motions are ubiquitous in the solar surface convection and occur in a wide range of temporal and spatial scales. Their interplay with magnetic fields is poorly characterized, however. Aims. We study the relation between a persistent photospheric vortex flow and the evolution of a network magnetic element at a supergranular vertex. Methods. We used long-duration sequences of continuum intensity images acquired with Hinode and the local correlation-tracki

APA, Harvard, Vancouver, ISO, and other styles

34

Lin, Zhe, Fan Zhang, Xuemin Lin, Wenjie Zhang, and Zhihong Tian. "Hierarchical core maintenance on large dynamic graphs." Proceedings of the VLDB Endowment 14, no. 5 (2021): 757–70. http://dx.doi.org/10.14778/3446095.3446099.

Full text

Abstract:

The model of k -core and its decomposition have been applied in various areas, such as social networks, the world wide web, and biology. A graph can be decomposed into an elegant k -core hierarchy to facilitate cohesive subgraph discovery and network analysis. As many real-life graphs are fast evolving, existing works proposed efficient algorithms to maintain the coreness value of every vertex against structure changes. However, the maintenance of the k -core hierarchy in existing studies is not complete because the connections among different k -cores in the hierarchy are not considered. In t

APA, Harvard, Vancouver, ISO, and other styles

35

Liaw, Sy-Sang. "Transition amplitudes in the Dirac–Fock approximation." Canadian Journal of Physics 70, no. 8 (1992): 644–51. http://dx.doi.org/10.1139/p92-104.

Full text

Abstract:

Transition amplitudes for several iso-electronic sequences are computed on the frozen-core Dirac–Fock approximation using the B-spline method. The length and velocity forms of the oscillator strengths are shown to be equal numerically if the nonlocal effective vertex is used. These gauge-invariant values, when compared with other theoretical results aiming for the exact values of the oscillate strengths, show satisfactory quality. We also find a peculiar feature for some transitions.

APA, Harvard, Vancouver, ISO, and other styles

36

Wu, Yanping, Jun Zhao, Renjie Sun, Chen Chen, and Xiaoyang Wang. "Efficient Personalized Influential Community Search in Large Networks." Data Science and Engineering 6, no. 3 (2021): 310–22. http://dx.doi.org/10.1007/s41019-021-00163-3.

Full text

Abstract:

AbstractCommunity search, which aims to retrieve important communities (i.e., subgraphs) for a given query vertex, has been widely studied in the literature. In the recent, plenty of research is conducted to detect influential communities, where each vertex in the network is associated with an influence value. Nevertheless, there is a paucity of work that can support personalized requirement. In this paper, we propose a new problem, i.e., maximal personalized influential community search. Given a graph G, an integer k and a query vertex u, we aim to obtain the most influential community for u

APA, Harvard, Vancouver, ISO, and other styles

37

Androsov, Alexey, Vera Fofonova, Ivan Kuznetsov, et al. "FESOM-C v.2: coastal dynamics on hybrid unstructured meshes." Geoscientific Model Development 12, no. 3 (2019): 1009–28. http://dx.doi.org/10.5194/gmd-12-1009-2019.

Full text

Abstract:

Abstract. We describe FESOM-C, the coastal branch of the Finite-volumE Sea ice – Ocean Model (FESOM2), which shares with FESOM2 many numerical aspects, in particular its finite-volume cell-vertex discretization. Its dynamical core differs in the implementation of time stepping, the use of a terrain-following vertical coordinate, and the formulation for hybrid meshes composed of triangles and quads. The first two distinctions were critical for coding FESOM-C as an independent branch. The hybrid mesh capability improves numerical efficiency, since quadrilateral cells have fewer edges than triang

APA, Harvard, Vancouver, ISO, and other styles

38

Suo, Lina, Haimiao Zhou, Ya-Pei Peng, Fan Yang, Hsiang-Chen Chui, and Nan-Kuang Chen. "High Sensitivity Fiber Refractive Index Sensors Based on Asymmetric Supermodes Interference in Tapered Four Core Fiber." Photonics 9, no. 1 (2022): 45. http://dx.doi.org/10.3390/photonics9010045.

Full text

Abstract:

We demonstrate high sensitivity fiber refractive index (RI) sensor based on asymmetric supermode interferences in tapered four core fiber (TFCF). To make TFCF-based RI sensors, the whitelight was launched into any one of the cores to define the excitation orientation and is called a vertex-core excitation scheme. When the four-core fiber (FCF) was gradually tapered, the four cores gathered closer and closer. Originally, the power coupling occurred between its two neighboring cores first and these three cores are grouped to produce supermodes. Subsequently, the fourth diagonal core enters the e

APA, Harvard, Vancouver, ISO, and other styles

39

Yao, Hai-Jun, Chun-Hua hu, Jie Sun, et al. "Isolation and Structure of [(PPh3)3(PPh2)2Pd4B20H16]. A Possible Prognostic for New Globular Borane-Based Cluster Architectures." Collection of Czechoslovak Chemical Communications 64, no. 6 (1999): 927–37. http://dx.doi.org/10.1135/cccc19990927.

Full text

Abstract:

A novel metallaborane compound, [(PPh3)3(PPh2)2Pd4B20H16], prepared from [PdCl2(PPh3)2] and [B10H10]2- in EtOH, exhibits a globular cluster architecture consisting of two twelve-vertex closo {PdB11} cluster units fused to generate a condensed globular {PdB20} assembly that has a tetrahedral {B4} borons-only core. There is dynamic bonding between this borane-based assembly and an unusual exopolyhedral palladium-based domain consisting of a {(PPh3)Pd(PPh2)Pd(PPh2)Pd(PPh3)} string. The central tetrahedral borons-only core suggests a new type of globular "megaloborane" architectural principle for

APA, Harvard, Vancouver, ISO, and other styles

40

Cacciapuoti, Claudio. "Scale Invariant Effective Hamiltonians for a Graph with a Small Compact Core." Symmetry 11, no. 3 (2019): 359. http://dx.doi.org/10.3390/sym11030359.

Full text

Abstract:

We consider a compact metric graph of size ε and attach to it several edges (leads) of length of order one (or of infinite length). As ε goes to zero, the graph G ε obtained in this way looks like the star-graph formed by the leads joined in a central vertex. On G ε we define an Hamiltonian H ε , properly scaled with the parameter ε . We prove that there exists a scale invariant effective Hamiltonian on the star-graph that approximates H ε (in a suitable norm resolvent sense) as ε → 0 . The effective Hamiltonian depends on the spectral properties of an auxiliary ε -independent Hamiltonian defi

APA, Harvard, Vancouver, ISO, and other styles

41

Alam, Md Tanvir, Chowdhury Farhan Ahmed, and Md Samiullah. "A Vertex-extension based Algorithm for Frequent Pattern Mining from Graph Databases." Dhaka University Journal of Applied Science and Engineering 7, no. 1 (2023): 58–65. http://dx.doi.org/10.3329/dujase.v7i1.62887.

Full text

Abstract:

Frequent pattern mining is a core problem in data mining. Algorithms for frequent pattern mining have been proposed for itemsets, sequences, and graphs. However, existing graph mining frameworks follow an edge-growth approach to building patterns which limits many applications. Motivated by real-life problems, in this work, we define a novel graph mining framework that incorporates vertex-based extensions along with the edge-growth approach. We also propose an efficient algorithm for mining frequent subgraphs. To deal with the exploding search space, we introduce a canonical labeling technique

APA, Harvard, Vancouver, ISO, and other styles

42

Kapoor, R. C., and C. S. Shukre. "A Geometrical origin of the Pulsar Core and Conal Emissions." International Astronomical Union Colloquium 160 (1996): 229–30. http://dx.doi.org/10.1017/s0252921100041579.

Full text

Abstract:

We have analysed the dipole magnetic field geometry for the general case of an oblique rotator and have found that open field lines which define the polar cap divide into two branches (Kapoor and Shukre 1996) which appear naturally relevant for distinguishing the core and conal emissions. The polar cap shape is actually determined by a quadratic equation having two roots leading to two values of the polar angle,θ+andθ−with respect to the magnetic axis for a given azimuth φ. For the north pole bothθ+andθ−branches are shown as polar plots in Fig. 1 for various inclination angles α and a typical

APA, Harvard, Vancouver, ISO, and other styles

43

Klose, Thomas, and Michael G. Rossmann. "Structure of large dsDNA viruses." Biological Chemistry 395, no. 7-8 (2014): 711–19. http://dx.doi.org/10.1515/hsz-2014-0145.

Full text

Abstract:

Abstract Nucleocytoplasmic large dsDNA viruses (NCLDVs) encompass an ever-increasing group of large eukaryotic viruses, infecting a wide variety of organisms. The set of core genes shared by all these viruses includes a major capsid protein with a double jelly-roll fold forming an icosahedral capsid, which surrounds a double layer membrane that contains the viral genome. Furthermore, some of these viruses, such as the members of the Mimiviridae and Phycodnaviridae have a unique vertex that is used during infection to transport DNA into the host.

APA, Harvard, Vancouver, ISO, and other styles

44

Brentano, Liana, Diana L. Noah, Earl G. Brown та Barbara Sherry. "The Reovirus Protein μ2, Encoded by the M1 Gene, Is an RNA-Binding Protein". Journal of Virology 72, № 10 (1998): 8354–57. http://dx.doi.org/10.1128/jvi.72.10.8354-8357.1998.

Full text

Abstract:

ABSTRACT The reovirus M1, L1, and L2 genes encode proteins found at each vertex of the viral core and are likely to form a structural unit involved in RNA synthesis. Genetic analyses have implicated the M1 gene in viral RNA synthesis and core nucleoside triphosphatase activity, but there have been no direct biochemical studies of μ2 function. Here, we expressed μ2 in vitro and assessed its RNA-binding activity. The expressed μ2 binds both poly(I-C)- and poly(U)-Sepharose, and binding activity is greater in Mn2+ than in Mg2+. Heterologous RNA competes for μ2 binding to reovirus RNA transcripts

APA, Harvard, Vancouver, ISO, and other styles

45

GAO, PU. "The Firstk-Regular Subgraph is Large." Combinatorics, Probability and Computing 23, no. 3 (2014): 412–33. http://dx.doi.org/10.1017/s0963548314000169.

Full text

Abstract:

Let$(G_m)_{0\le m\le \binom{n}{2}}$be the random graph process starting from the empty graph on vertex set [n] and with a random edge added in each step. Letmkdenote the minimum integer such thatGmkcontains ak-regular subgraph. We prove that for all sufficiently largek, there exist two constants εk≥ σk> 0, with εk→ 0 ask→ ∞, such that asymptotically almost surely anyk-regular subgraph ofGmkhas size between (1 − εk)|${\mathcal C}_k$| and (1 − σk)|${\mathcal C}_k$|, where${\mathcal C}_k$denotes thek-core ofGmk.

APA, Harvard, Vancouver, ISO, and other styles

46

Stockinger, G., H.-T. Janka, D. Kresse, et al. "Three-dimensional models of core-collapse supernovae from low-mass progenitors with implications for Crab." Monthly Notices of the Royal Astronomical Society 496, no. 2 (2020): 2039–84. http://dx.doi.org/10.1093/mnras/staa1691.

Full text

Abstract:

ABSTRACT We present 3D full-sphere supernova simulations of non-rotating low-mass (∼9 M⊙) progenitors, covering the entire evolution from core collapse through bounce and shock revival, through shock breakout from the stellar surface, until fallback is completed several days later. We obtain low-energy explosions (∼0.5–1.0 × 1050 erg) of iron-core progenitors at the low-mass end of the core-collapse supernova (LMCCSN) domain and compare to a super-AGB (sAGB) progenitor with an oxygen–neon–magnesium core that collapses and explodes as electron-capture supernova (ECSN). The onset of the explosio

APA, Harvard, Vancouver, ISO, and other styles

47

COUDERT, DAVID, FREDERIC GIROIRE, and IGNASI SAU. "CIRCUITS IN GRAPHS THROUGH A PRESCRIBED SET OF ORDERED VERTICES." Journal of Interconnection Networks 11, no. 03n04 (2010): 121–41. http://dx.doi.org/10.1142/s0219265910002763.

Full text

Abstract:

A circuit in a simple undirected graph G = (V, E) is a sequence of vertices {v1, v2, …, vk+1} such that v1 = vk+1 and {vi, vi+1} ∈ E for i = 1, …, k. A circuit C is said to be edge-simple if no edge of G is used twice in C. In this article we study the following problem: which is the largest integer k such that, given any subset of k ordered vertices of a graph G, there exists an edge-simple circuit visiting the k vertices in the prescribed order? We first study the case when G has maximum degree at most 3, establishing the value of k for several subcases, such as when G is planar or 3-vertex-

APA, Harvard, Vancouver, ISO, and other styles

48

Melson, Tobias, Hans-Thomas Janka, Alexander Summa, Robert Bollig, Andreas Marek, and Bernhard Müller. "Exploring the explosion mechanism of core-collapse supernovae in three dimensions." Proceedings of the International Astronomical Union 12, S329 (2016): 424. http://dx.doi.org/10.1017/s1743921317001181.

Full text

Abstract:

AbstractWe present the first successful simulations of neutrino-driven supernova explosions in three dimensions (3D) using the Vertex-Prometheus code including sophisticated energy-dependent neutrino transport. The simulated models of 9.6 and 20 solar-mass iron-core stars demonstrate that successful explosions can be obtained in self-consistent 3D simulations, where previous models have failed. New insights into the supernova mechanism can be gained from these explosions. The first 3D model (Melson et al. 2015a) explodes at the same time but more energetically than its axially symmetric (2D) c

APA, Harvard, Vancouver, ISO, and other styles

49

Silvestry, Mariena, Steffen Lindert, Jason G. Smith, et al. "Cryo-Electron Microscopy Structure of Adenovirus Type 2 Temperature-Sensitive Mutant 1 Reveals Insight into the Cell Entry Defect." Journal of Virology 83, no. 15 (2009): 7375–83. http://dx.doi.org/10.1128/jvi.00331-09.

Full text

Abstract:

ABSTRACT The structure of the adenovirus type 2 temperature-sensitive mutant 1 (Ad2ts1) was determined to a resolution of 10 Å by cryo-electron microscopy single-particle reconstruction. Ad2ts1 was prepared at a nonpermissive temperature and contains the precursor forms of the capsid proteins IIIa, VI, and VIII; the core proteins VII, X (mu), and terminal protein (TP); and the L1-52K protein. Cell entry studies have shown that although Ad2ts1 can bind the coxsackievirus and Ad receptor and undergo internalization via αv integrins, this mutant does not escape from the early endosome and is tar

APA, Harvard, Vancouver, ISO, and other styles

50

Thakral, Preston P., Kevin P. Madore, Sarah E. Kalinowski, and Daniel L. Schacter. "Modulation of hippocampal brain networks produces changes in episodic simulation and divergent thinking." Proceedings of the National Academy of Sciences 117, no. 23 (2020): 12729–40. http://dx.doi.org/10.1073/pnas.2003535117.

Full text

Abstract:

Prior functional magnetic resonance imaging (fMRI) studies indicate that a core network of brain regions, including the hippocampus, is jointly recruited during episodic memory, episodic simulation, and divergent creative thinking. Because fMRI data are correlational, it is unknown whether activity increases in the hippocampus, and the core network more broadly, play a causal role in episodic simulation and divergent thinking. Here we employed fMRI-guided transcranial magnetic stimulation (TMS) to assess whether temporary disruption of hippocampal brain networks impairs both episodic simulatio

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!