4865 search results - page 231 / 973 » The Complexity of Graph Connectivity |
139
click to vote
IPMU
2010
Springer
15 years 7 months ago
2010
Springer
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
136
click to vote
PCI
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Graphs are useful data structures capable of efficiently representing a variety of technological and social networks. They are therefore utilized in simulation-based stud...
154
Voted
COCOON
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
170
Voted
CORR
2008
Springer
15 years 5 months ago
2008
Springer
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is relate...
137
Voted
CORR
2006
Springer
15 years 5 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...