Skip to search formSkip to main contentSkip to account menu

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 (opens in a new tab)

Related topics

Related topics

4 relations
Convex setMedian graphPartial cube

Broader (1)

Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A Faster Algorithm for Enumerating Connected Convex Subgraphs in Acyclic Digraphs
Subgraph enumeration is one of the most crucial steps involved in the custom instruction identification for application-specific… 
2014
2014
Zeros of Convex Subgraph Polynomials
A subgraph H of a graph G is said to be convex if for every pair of vertices in H ,a nyu-v geodesic in G lies entirely in H. We… 
2012
2012
Graph clustering using graph entropy complexity traces
In this paper, we aim to present a principled approach to the problem of depth-based complexity characterisation of graphs. Our… 
2011
2011
Efficient maximal convex custom instruction enumeration for extensible processors
In recent years, the use of extensible processors has been increased. Extensible processors extend the base instruction set of a… 
2011
2011
Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs
We study the following graph partitioning problem: Given two positive integers $C$ and $\Delta$, find the least integer $M(C… 
2010
2010
Simultaneous embeddings of graphs as median and antimedian subgraphs
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… 
2008
2008
CONVEX (ANTI)MEDIAN SUBGRAPHS OF GRAPHS
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… 
2008
2008
An Algorithm for Finding Connected Convex Subgraphs of an Acyclic Digraph
A subgraph H of an acyclic digraph D is convex if there is no directed path between vertices of H which contains an arc not in H… 
1984
1984
A convex characterization of the graphs of the dodecahedron and icosahedron
1984
1984
On the reconstruction of rayless infinite forests
A graph G is called strongly p-reconstructible if it is (up to isomorphism) uniquely determined by the collection of its pairwise… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)