# Convex subgraph

In metric graph theory, a convex subgraph of an undirected graph G is a subgraph that includes every shortest path in G between two of its vertices…
Wikipedia

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
• IEEE High Performance Extreme Computing…
• 2017
• Corpus ID: 9808269
The k-truss of a graph is a subgraph such that each edge is tightly connected to the remaining elements in the k-truss. The k…
2014
2014
• LCPC
• 2014
• Corpus ID: 6861065
New many-core architectures such as the Kalray MPPA-256 provide energy-efficiency and high performance for embedded systems…
2012
2012
• Proceedings of the 21st International Conference…
• 2012
• Corpus ID: 8675651
In this paper, we aim to present a principled approach to the problem of depth-based complexity characterisation of graphs. Our…
2008
2008
• 2008
• Corpus ID: 9196025
The distance DG(v) of a vertex v in an undirected graph G is the sum of the distances between v and all other vertices of G. The…
Review
2005
Review
2005
• SIAM Rev.
• 2005
• Corpus ID: 8849423
Graph coloring has been employed since the 1980s to efficiently compute sparse Jacobian and Hessian matrices using either finite…
2001
2001
A novel weakly overlapping two level additive Schwarz domain decomposition preconditioning algorithm is presented which is…
1999
1999
• Ars Comb.
• 1999
• Corpus ID: 5099356
Let $\Delta_k$ denote the maximum degree of the $k^{\rm th}$ iterated line graph $L^k(G)$. For any connected graph $G$ that is…
1990
1990
• R. Diestel
• J. Comb. Theory, Ser. B
• 1990
• Corpus ID: 34653456