3105 search results - page 25 / 621 » The Path-Packing Structure of Graphs |
103
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
In this paper, subgraphs and complementary graphs are used to analyze network synchronizability. Some sharp and attainable bounds are derived for the eigenratio of the network str...
163
Voted
FAW
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several grap...
126
click to vote
DAM
2010
15 years 1 months ago
2010
We consider the problem of sorting a permutation using a network of data structures as introduced by Knuth and Tarjan. In general the model as considered previously was restricted...
150
click to vote
TKDE
2012
13 years 4 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
113
click to vote
JMLR
2006
15 years 2 months ago
2006
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...