In this work, we explore parallel construction of spanners in hypergraphs. Spanners include all vertices and a subset of edges while ensuring shortest distances within an allowable stretch, making them crucial for eff...
详细信息
The arboricity (G) of a graph G is defined as the minimum number of edge-disjoint forests that the edge set of G can be partitioned into. It is a fundamental metric and has been widely used in many graph analysis appl...
详细信息
Suppose that we are given an independent set I-0 of a graph G, and an integer l >= 0. Then, we are asked to find an independent set of G having the maximum size among independent sets that are reachable from I-0 by...
详细信息
Suppose that we are given an independent set I-0 of a graph G, and an integer l >= 0. Then, we are asked to find an independent set of G having the maximum size among independent sets that are reachable from I-0 by either adding or removing a single vertex at a time such that all intermediate independent sets are of size at least l. We show that this problem is PSPACE-hard even for bounded-pathwidth graphs, and remains NP-hard for planar graphs. On the other hand, we give a linear-time algorithm to solve the problem for chordal graphs. We also study the parameterized complexity of the problem with respect to the following three parameters: the degeneracy d of an input graph, a lower bound l on the size of independent sets, and a lower bound s on the size of a solution reachable from I-0. We show that the problem is fixed-parameter intractable when only one of d, l, or s is taken as a parameter. On the other hand, we give a fixed-parameter algorithm when parameterized by s + d;this result implies that the problem parameterized only by s is fixed-parameter tractable for planar graphs, and for bounded-treewidth graphs.
In the age of big data, many graph algorithms are now required to operate in external memory and deliver performance that does not significantly degrade with the scale of the problem. One particular area that frequent...
详细信息
In the age of big data, many graph algorithms are now required to operate in external memory and deliver performance that does not significantly degrade with the scale of the problem. One particular area that frequently deals with graphs larger than RAM is triangle listing, where the algorithms must carefully piece together edges from multiple partitions to detect cycles. In recent literature, two competing proposals (i.e., Pagh and PCF) have emerged;however, neither one is universally better than the other. Since little is known about the I/O cost of PCF or how these methods compare to each other, we undertake an investigation into the properties of these algorithms, model their I/O cost, understand their shortcomings, and shed light on the conditions under which each method defeats the other. This insight leads us to develop a novel framework we call Trigon that surpasses the I/O performance of both previous techniques in all graphs and under all RAM conditions.
In this paper, we obtain the eccentricity spectrum and irreducibility of eccentricity matrix of the generalized friendship graph which is a generalization of the results in [12]. Also, we study the irreducibility of e...
详细信息
It is a critical issue to accurately calculate and optimize the various performances of a heliostat field. This paper presents a model for calculating the cosine efficiency using vector computation. Subsequently, anot...
详细信息
graph pooling aims at extracting vital information for graph coarsening, and thus helping graph neural networks to improve their graph representation ability. However, existing methods either compress similar nodes by...
详细信息
Beyond-planar graph classes are usually defined via forbidden configurations or patterns in a drawing. In this paper, we formalize these concepts on a combinatorial level and show that, for any fixed family F of cross...
详细信息
The reliability and performance of concurrency are severely affected by deadlocks in concurrent systems. An efficient deadlock detection algorithm is needed to ensure that any deadlock cases can be pre-empted. The pap...
详细信息
graphBLAS is a sparse matrix library for graph algorithms. We could improve the graphBLAS and support a wider range of applications if we had an indexed binary operator;i.e., a binary operator that depends on elements...
详细信息
暂无评论