Sciweavers

966 search results - page 29 / 194
» Small Alliances in Graphs
Sort
View
CN
2007
95views more  CN 2007»
13 years 8 months ago
Sampling large Internet topologies for simulation purposes
In this paper, we develop methods to ‘‘sample’’ a small realistic graph from a large Internet topology. Despite recent activity, modeling and generation of realistic graph...
Vaishnavi Krishnamurthy, Michalis Faloutsos, Marek...
MFCS
2009
Springer
14 years 3 months ago
The Longest Path Problem Is Polynomial on Interval Graphs
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
Kyriaki Ioannidou, George B. Mertzios, Stavros D. ...
MKM
2009
Springer
14 years 3 months ago
Exploring a Quantum Theory with Graph Rewriting and Computer Algebra
Graphical languages provide a powerful tool for describing the behaviour of quantum systems. While the use of graphs vastly reduces the complexity of many calculations [4,10], manu...
Aleks Kissinger
CORR
2010
Springer
73views Education» more  CORR 2010»
13 years 8 months ago
On Touching Triangle Graphs
Abstract. In this paper, we consider the problem of representing graphs by triangles whose sides touch. We present linear time algorithms for creating touching triangles representa...
Emden R. Gansner, Yifan Hu, Stephen G. Kobourov
LATIN
1995
Springer
14 years 5 days ago
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The appr...
David Fernández-Baca, Giora Slutzki