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)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Victor Chepoi, Kolja B. Knauer, Tilen Marc
- ArXiv
- 2016

We investigate the structure of isometric subgraphs of hypercubes (i.e., partial cubes) which do not contain finite convexâ€¦Â (More)

Is this relevant?

2016

2016

- Tilen Marc, Lovro Subelj
- ArXiv
- 2016

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

- 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

- Joseph Reddington, Kubilay Atasu
- IEEE Transactions on Very Large Scale Integrationâ€¦
- 2012

Synthesis of custom instruction processors from high-level application descriptions involves automated evaluation of data-flowâ€¦Â (More)

Is this relevant?

2008

2008

- Kubilay Atasu, Oskar Mencer, Wayne Luk, Can C. Ã–zturan, GÃ¼nhan DÃ¼ndar
- 2008 International Conference on Applicationâ€¦
- 2008

Automatic generation of custom instruction processors from high-level application descriptions enables fast design spaceâ€¦Â (More)

Is this relevant?

2008

2008

- K. Balakrishnan, Bostjan Bresar, Manoj Changat, Sandi Klavzar, Matjaz Kovse, Ajitha R. Subhamathi
- 2008

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)

Is this relevant?

2007

2007

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

- Ignasi Sau, Janez Zerovnik
- 2006

In the permutation routing problem, each processor is the origin of at most one packet and each processor is the destination ofâ€¦Â (More)

Is this relevant?

2003

2003

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

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?