Sciweavers

141 search results - page 5 / 29
» Layout Problems on Lattice Graphs
Sort
View
CPHYSICS
2011
271views Education» more  CPHYSICS 2011»
13 years 2 days ago
A dedicated algorithm for calculating ground states for the triangular random bond Ising model
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
O. Melchert, A. K. Hartmann
VISSYM
2007
13 years 11 months ago
Visualization of Uncertainty in Lattices to Support Decision-Making
Lattice graphs are used as underlying data structures in many statistical processing systems, including natural language processing. Lattices compactly represent multiple possible...
Christopher Collins, M. Sheelagh T. Carpendale, Ge...
CPM
2004
Springer
168views Combinatorics» more  CPM 2004»
14 years 1 months ago
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robe...
APVIS
2006
13 years 10 months ago
Increasing the readability of graph drawings with centrality-based scaling
A common problem in visualising some networks is the presence of localised high density areas in an otherwise sparse graph. Applying common graph drawing algorithms on such networ...
Damian Merrick, Joachim Gudmundsson
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
14 years 1 months ago
Linear-Time Recognition of Probe Interval Graphs
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a varia...
Ross M. McConnell, Yahav Nussbaum