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.
2014
2014
Automatic Streamization of Image Processing Applications
New many-core architectures such as the Kalray MPPA-256 provide energy-efficiency and high performance for embedded systems… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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
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
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… Expand
  • figure 1
  • table 1
  • table 2
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
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
2003
2003
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
2001
2001
Parallel domain decomposition preconditioning for the adaptive finite element solution of elliptic problems in three dimensions
A novel weakly overlapping two level additive Schwarz domain decomposition preconditioning algorithm is presented which is… Expand
  • figure 1.2
  • figure 3.5
1990
1990
Simplicial tree-decompositions of infinite graphs, I
  • R. Diestel
  • J. Comb. Theory, Ser. B
  • 1990
    • Corpus ID: 34653456
Abstract This paper is intended as an introduction to the theory of simplicial decompositions of graphs. It presents, in a… Expand
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
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