FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1998-2016
012319982016

Related topics

Related topics

4 relations
Convex setMedian graphPartial cube

Broader (1)

Graph theory

Related mentions per year

Related mentions per year

1949-2018
19401960198020002020
Convex subgraph
Convex set
Graph theory
Median graph
Partial cube

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Partial cubes without $Q_3^-$ minors
We investigate the structure of isometric subgraphs of hypercubes (i.e., partial cubes) which do not contain finite convex… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2016
2016
On convexity in complex networks
Lovro Šubelj University of Ljubljana, Faculty of Computer and Information Science Ljubljana, Slovenia lovro.subelj@fri.uni-lj.si… (More)
Is this relevant?
2014
2014
Zeros of Convex Subgraph Polynomials
  • Ladznar S. Laja
  • 2014
A subgraph H of a graph G is said to be convex if for every pair of vertices in H, any u-v geodesic in G lies entirely in H. We… (More)
Is this relevant?
2012
2012
Complexity of Computing Convex Subgraphs in Custom Instruction Synthesis
Synthesis of custom instruction processors from high-level application descriptions involves automated evaluation of data-flow… (More)
  • figure 1
  • figure 2
  • figure 3
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… (More)
  • 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… (More)
  • figure 1
  • figure 2
Is this relevant?
2007
2007
Antimedian and median subsets of graphs∗
A profile on a graph G is a finite sequence of vertices of G. The remoteness of a vertex u is the sum of distances to the… (More)
Is this relevant?
2006
2006
An optimal permutation routing algorithm for full-duplex hexagonal mesh networks
In the permutation routing problem, each processor is the origin of at most one packet and each processor is the destination of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
On Central Root Automorphisms of Finite Generalised Hexagons
Let A be the flag complex of a generalised 2m-gon, with m 2 2, and let G be a group of special automorphisms of A. An… (More)
Is this relevant?
1998
1998
Relations between Median Graphs, Semi-median Graphs and Partial Cubes
A rich structure theory has been developed in the last three decades for graphs embed dable into hypercubes in particular for… (More)
Is this relevant?