Skip to search formSkip to main content

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

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

2017

2017

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

Is this relevant?

2012

2012

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

Is this relevant?

2012

2012

Topological relativity is a concept of interest in geographic information theory. One way of assessing the importance of topology… Expand

Is this relevant?

2011

2011

Stocks with similar financial ratio values across years have similar price movements. We investigate this hypothesis by… Expand

Is this relevant?

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

Is this relevant?

2008

2008

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

Is this relevant?

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

Is this relevant?

2007

2007

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

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

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?