Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 206,140,285 papers from all fields of science
Search
Sign In
Create Free Account
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
Create Alert
Alert
Related topics
Related topics
4 relations
Convex set
Median graph
Partial cube
Broader (1)
Graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Quickly finding a truss in a haystack
Oded Green
,
James Fox
,
+9 authors
David A. Bader
IEEE High Performance Extreme Computing…
2017
Corpus ID: 9808269
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
2014
2014
Automatic Streamization of Image Processing Applications
P. Guillou
,
F. Coelho
,
F. Irigoin
LCPC
2014
Corpus ID: 6861065
New many-core architectures such as the Kalray MPPA-256 provide energy-efficiency and high performance for embedded systems…
Expand
2012
2012
Graph clustering using graph entropy complexity traces
Lu Bai
,
E. Hancock
,
Lin Han
,
Peng Ren
Proceedings of the 21st International Conference…
2012
Corpus ID: 8675651
In this paper, we aim to present a principled approach to the problem of depth-based complexity characterisation of graphs. Our…
Expand
2011
2011
A case study on financial ratios via cross-graph quasi-bicliques
Kelvin Sim
,
Guimei Liu
,
V. Gopalkrishnan
,
Jinyan Li
Inf. Sci.
2011
Corpus ID: 13827933
2010
2010
Another aspect of graph invariants depending on the path metric and an application in nanoscience
M. H. Khalifeh
,
H. Yousefi-Azari
,
A. Ashrafi
Comput. Math. Appl.
2010
Corpus ID: 16621015
2008
2008
CONVEX (ANTI)MEDIAN SUBGRAPHS OF GRAPHS
B. Brešar
,
M. Changat
,
S. Klavžar
,
M. Kovse
,
A. R. Subhamathi
2008
Corpus ID: 9196025
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
Review
2005
Review
2005
What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
A. Gebremedhin
,
F. Manne
,
A. Pothen
SIAM Rev.
2005
Corpus ID: 8849423
Graph coloring has been employed since the 1980s to efficiently compute sparse Jacobian and Hessian matrices using either finite…
Expand
2001
2001
Parallel domain decomposition preconditioning for the adaptive finite element solution of elliptic problems in three dimensions
S. Nadeem
2001
Corpus ID: 43735408
A novel weakly overlapping two level additive Schwarz domain decomposition preconditioning algorithm is presented which is…
Expand
1999
1999
Minimum Degree Growth of the Iterated Line Graph
S. Hartke
,
Aparna W. Higgins
Ars Comb.
1999
Corpus ID: 5099356
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
1990
1990
Simplicial tree-decompositions of infinite graphs, I
R. Diestel
J. Comb. Theory, Ser. B
1990
Corpus ID: 34653456
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