Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

2014

2014

New many-core architectures such as the Kalray MPPA-256 provide energy-efficiency and high performance for embedded systems… Expand

2012

2012

In this paper, we aim to present a principled approach to the problem of depth-based complexity characterisation of graphs. Our… Expand

2009

2009

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

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

2008

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

2008

2008

Automatic generation of custom instruction processors from high-level application descriptions enables fast design space… Expand

2003

2003

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

A novel weakly overlapping two level additive Schwarz domain decomposition preconditioning algorithm is presented which is… Expand

1990

1990

Abstract This paper is intended as an introduction to the theory of simplicial decompositions of graphs. It presents, in a… Expand

1982

1982

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