Sciweavers

1132 search results - page 51 / 227
» Similarity Graphs
Sort
View
105
Voted
CCE
2006
15 years 24 days ago
New approaches for representing, analyzing and visualizing complex kinetic transformations
Complex kinetic mechanisms involving thousands of reacting species and tens of thousands of reactions are currently required for the rational analysis of modern combustion systems...
Ioannis P. Androulakis
89
Voted
APVIS
2007
15 years 2 months ago
A comparison of vertex ordering algorithms for large graph visualization
In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices. Visual similarity matrices display the relationsh...
Christopher Mueller, Benjamin Martin, Andrew Lumsd...
92
Voted
STACS
2010
Springer
15 years 7 months ago
Large-Girth Roots of Graphs
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
Anna Adamaszek, Michal Adamaszek
111
Voted
COMBINATORICS
2004
97views more  COMBINATORICS 2004»
15 years 18 days ago
Tight Estimates for Eigenvalues of Regular Graphs
It is shown that if a d-regular graph contains s vertices so that the distance between any pair is at least 4k, then its adjacency matrix has at least s eigenvalues which are at l...
Alon Nilli
COMBINATORICA
2010
14 years 7 months ago
Approximation algorithms via contraction decomposition
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...