Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

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
Quickly finding a truss in a haystack
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… Expand
  • table I
  • table II
  • table III
  • figure 1
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • table 1
Is this relevant?
2012
2012
An Ordering of Convex Topological Relations
Topological relativity is a concept of interest in geographic information theory. One way of assessing the importance of topology… Expand
  • figure 2
  • figure 3
  • figure 4
  • table 2
  • table 3
Is this relevant?
2011
2011
A case study on financial ratios via cross-graph quasi-bicliques
Stocks with similar financial ratio values across years have similar price movements. We investigate this hypothesis by… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
On the number of connected convex subgraphs of a connected acyclic digraph
A digraph D is connected if the underlying undirected graph of D is connected. A subgraph H of an acyclic digraph D is convex if… Expand
Is this relevant?
2008
2008
Fast custom instruction identification by convex subgraph enumeration
Automatic generation of custom instruction processors from high-level application descriptions enables fast design space… Expand
  • figure 1
  • figure 4
  • figure 2
  • table 1
  • figure 5
Is this relevant?
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… Expand
  • figure 1
  • figure 2
Is this relevant?
2007
2007
Polynomial-time subgraph enumeration for automated instruction set extension
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex… Expand
Is this relevant?
1999
1999
Minimum Degree Growth of the Iterated Line Graph
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… Expand
Is this relevant?
1982
1982
A characterization of the n-cube by convex subgraphs
We prove that if @C is a finite connected graph having the same convex subgraphs as the graph of the n-dimensional cube Q"n (n>=3… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE