scroll to top
0

EBSCO Auth Banner

Let's find your institution. Click here.

Advanced Search Results For "graph theory"

1 - 10 of 83,687 results for
 "graph theory"
Results per page:

Atomic Embeddability, Clustered Planarity, and Thickenability.

Publication Type: Academic Journal

Source(s): Journal of the ACM. Mar2022, Vol. 69 Issue 2, p1-34. 34p.

Abstract: We study the atomic embeddability testing problem, which is a common generalization of clustered planarity (c-planarity, for short) and thickenability testing, and present a polynomial-time algorithm for this problem, thereby giving the first polynomia...

View details

Continuous cubic formulations for cluster detection problems in networks.

Publication Type: Academic Journal

Source(s): Mathematical Programming. Nov2022, Vol. 196 Issue 1/2, p279-307. 29p.

Abstract: The celebrated Motzkin–Straus formulation for the maximum clique problem provides a nontrivial characterization of the clique number of a graph in terms of the maximum value of a nonconvex quadratic function over a standard simplex. It was originally d...

View details

Scaling the Maximum Flow Computation on GPUs.

Publication Type: Academic Journal

Source(s): International Journal of Parallel Programming. Dec2022, Vol. 50 Issue 5/6, p515-561. 47p.

Abstract: Maximum flow is one of the fundamental problems in graph theory with several applications such as bipartite matchings, image segmentation, disjoint paths, network connectivity, etc. Goldberg-Tarjan's well-known Push Relabel (PR) Algorithm calculates th...

View details

Hamiltonian cycle curves in the space of discounted occupational measures.

Publication Type: Academic Journal

Source(s): Annals of Operations Research. Oct2022, Vol. 317 Issue 2, p605-622. 18p.

Abstract: We study the embedding of the Hamiltonian Cycle problem, on a symmetric graph, in a discounted Markov decision process. The embedding allows us to explore the space of occupational measures corresponding to that decision process. In this paper we consi...

View details

Differentially private containment control for multi-agent systems.

Publication Type: Academic Journal

Source(s): International Journal of Systems Science. Oct2022, Vol. 53 Issue 13, p2814-2831. 18p.

Abstract: This paper is concerned with the differential privacy-based containment control problem for a class of discrete-time multi-agent systems (MASs) with time-varying topology. The classical containment control implementation relies on the explicit informat...

View details

1-Perfect Codes Over the Quad-Cube.

Publication Type: Academic Journal

Source(s): IEEE Transactions on Information Theory. Oct2022, Vol. 68 Issue 10, p6481-6504. 24p.

Abstract: A vertex subset $S$ of a graph $G$ constitutes a 1-perfect code if the one-balls centered at the nodes in $S$ effect a vertex partition of $G$. This paper considers the quad-cube $CQ_{m}$ that is a connected $(m+2)$ -regular spanning subgraph of the hy...

View details

Quantum chemistry-augmented neural networks for reactivity prediction: Performance, generalizability, and explainability.

Publication Type: Academic Journal

Source(s): Journal of Chemical Physics. 2/28/2022, Vol. 156 Issue 8, p1-13. 13p.

Abstract: There is a perceived dichotomy between structure-based and descriptor-based molecular representations used for predictive chemistry tasks. Here, we study the performance, generalizability, and explainability of the quantum mechanics-augmented graph neu...

View details

Applications of maximum independent set.

Publication Type: Conference

Source(s): AIP Conference Proceedings. 10/25/2022, Vol. 2398 Issue 1, p1-10. 10p.

Abstract: Combinatorial optimizations is subfield optimization which exists to find the optimality from finite set, and it has important applications in several fields. NP- hard problem is one of the important tools in combinatorial optimizations. We introduce c...

View details

Graph-theoretical exploration of the relation between conductivity and connectivity in heteroatom-containing single-molecule junctions.

Publication Type: Academic Journal

Source(s): Journal of Chemical Physics. 3/7/2022, Vol. 156 Issue 9, p1-8. 8p.

Abstract: In this study, we employ the Sachs graph theory to formulate the conduction properties of a single-molecular junction consisting of a molecule in which one carbon atom of an alternant hydrocarbon is replaced with a heteroatom. The derived formula inclu...

View details

On the Power of Symmetric Linear Programs.

Publication Type: Academic Journal

Source(s): Journal of the ACM. Jul2021, Vol. 68 Issue 4, p1-35. 35p.

Abstract: We consider families of symmetric linear programs (LPs) that decide a property of graphs (or other relational structures) in the sense that, for each size of graph, there is an LP defining a polyhedral lift that separates the integer points correspondi...

View details
sponsored