Sciweavers

504 search results - page 6 / 101
» Canonical Graph Shapes
Sort
View
SECURWARE
2008
IEEE
14 years 2 months ago
Optimal Trust Network Analysis with Subjective Logic
Trust network analysis with subjective logic (TNA-SL) simplifies complex trust graphs into series-parallel graphs by removing the most uncertain paths to obtain a canonical graph...
Audun Jøsang, Touhid Bhuiyan
ENDM
2006
75views more  ENDM 2006»
13 years 8 months ago
The structure and unlabelled enumeration of toroidal graphs with no K3, 3's
We characterize the toroidal graphs with no K3,3-subdivisions as canonical compositions in which 2-pole planar networks are substituted for the edges of non-planar cores. This str...
Andrei Gagarin, Gilbert Labelle, Pierre Leroux
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...
SAC
2004
ACM
14 years 2 months ago
Frequent free tree discovery in graph data
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
Ulrich Rückert, Stefan Kramer
SHAPE
1999
Springer
14 years 25 days ago
Recognizing Objects Using Color-Annotated Adjacency Graphs
Peter Henry Tu, Tushar Saxena, Richard I. Hartley