Log in

Relevant bibliographies by topics / CORE VERTEX

Contents

Journal articles

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "CORE VERTEX"

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

More sources

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!