scroll to top

EBSCO Auth Banner

Let's find your institution. Click here.

Advanced Search Results For "DENSE graphs"

1 - 10 of 486 results for
 "DENSE graphs"
Results per page:

Enumeration for FO Queries over Nowhere Dense Graphs.

Publication Type: Academic Journal

Source(s): Journal of the ACM. May2022, Vol. 69 Issue 3, p1-37. 37p.

Abstract: We consider the evaluation of first-order queries over classes of databases that are nowhere dense. The notion of nowhere dense classes was introduced by Nešetřil and Ossona de Mendez as a formalization of classes of "sparse" graphs and generalizes man...

Approximate distance oracles with improved stretch for sparse graphs.

Publication Type: Academic Journal

Source(s): Theoretical Computer Science. Jan2023, Vol. 943, p89-101. 13p.

Abstract: Thorup and Zwick [1] introduced the notion of approximate distance oracles, a data structure that produces for an n -vertex, m -edge weighted undirected graph G = (V , E) , distance estimations in constant query time. They presented a distance oracle o...

Augmentation of Densest Subgraph Finding Unsupervised Feature Selection Using Shared Nearest Neighbor Clustering.

Publication Type: Academic Journal

Source(s): Algorithms. Jan2023, Vol. 16 Issue 1, p28. 12p.

Abstract: Determining the optimal feature set is a challenging problem, especially in an unsupervised domain. To mitigate the same, this paper presents a new unsupervised feature selection method, termed as densest feature graph augmentation with disjoint featur...

Attention-Based Graph Convolutional Network for Zero-Shot Learning with Pre-Training.

Publication Type: Academic Journal

Source(s): Mathematical Problems in Engineering. 12/7/2021, p1-13. 13p.

Abstract: Zero-shot learning (ZSL) is a powerful and promising learning paradigm for classifying instances that have not been seen in training. Although graph convolutional networks (GCNs) have recently shown great potential for the ZSL tasks, these models canno...

Perfecting matching of an undirected dense based on geometric multiplicity.

Publication Type: Conference

Source(s): AIP Conference Proceedings. 2022, Vol. 2516 Issue 1, p1-8. 8p.

Abstract: One of the important concepts of Graph Theory is Matching Theory. Several Concepts on Matching Theory has been dealt in [1, 2, 3]. The technique of maximum matching on directed graphs have been studied in [1]. In this paper, a new approach for finding ...

Chromatic index of dense quasirandom graphs.

Publication Type: Academic Journal

Source(s): Journal of Combinatorial Theory - Series B. Nov2022, Vol. 157, p429-450. 22p.


Abstract: Let G be a simple graph with maximum degree Δ (G). A subgraph H of G is overfull if | E (H) | > Δ (G) ⌊ | V (H) | / 2 ⌋. Chetwynd and Hilton in 1986 conjectured that a graph G on n vertices with Δ (G) > n / 3 has chromatic index Δ (G) if and only if G ...


Publication Type: Academic Journal

Source(s): SIAM Journal on Discrete Mathematics. 2022, Vol. 36 Issue 4, p2975-2994. 20p.

Abstract: For two graphs G and H, write G rbw \rightarrow H if G has the property that every proper coloring of its edges yields a rainbow copy of H. We study the thresholds for such so-called anti-Ramsey properties in randomly perturbed dense graphs, which are ...

On vertices contained in all or in no metric basis.

Publication Type: Academic Journal

Source(s): Discrete Applied Mathematics. Oct2022, Vol. 319, p407-423. 17p.

Abstract: A set R ⊆ V (G) is a resolving set of a graph G if for all distinct vertices v , u ∈ V (G) there exists an element r ∈ R such that d (r , v) ≠ d (r , u). The metric dimension dim (G) of the graph G is the cardinality of a smallest resolving set of G. A...

Uniformly Most Reliable Three-Terminal Graph of Dense Graphs.

Publication Type: Academic Journal

Source(s): Mathematical Problems in Engineering. 4/20/2021, p1-10. 10p.

Abstract: A graph G with k specified target vertices in vertex set is a k -terminal graph. The k -terminal reliability is the connection probability of the fixed k target vertices in a k -terminal graph when every edge of this graph survives independently with p...

MOCMIN: convex inferring of modular low-rank contact networks over COVID diffusion data.

Publication Type: Academic Journal

Source(s): Turkish Journal of Electrical Engineering & Computer Sciences. 2022, Vol. 30 Issue 7, p2568-2585. 18p.


Abstract: SEIR (which consists of susceptible, exposed, infected, and recovered states) is a common diffusion model which could model different disease propagation dynamics across various domains such as influenza and COVID diffusion. As a motivation, across the...