Sciweavers

702 search results - page 36 / 141
» Identifying Graph Automorphisms Using Determining Sets
Sort
View
CORR
2007
Springer
118views Education» more  CORR 2007»
14 years 11 months ago
Contains and Inside relationships within combinatorial Pyramids
7 Irregular pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids are used within the segmentation framework to encode a hierarchy of pa...
Luc Brun, Walter G. Kropatsch
ISAAC
2003
Springer
144views Algorithms» more  ISAAC 2003»
15 years 5 months ago
Biconnectivity on Symbolically Represented Graphs: A Linear Solution
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
Raffaella Gentilini, Alberto Policriti
DAM
2007
81views more  DAM 2007»
14 years 11 months ago
Graphs, partitions and Fibonacci numbers
The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees...
Arnold Knopfmacher, Robert F. Tichy, Stephan Wagne...
TIT
2010
170views Education» more  TIT 2010»
14 years 6 months ago
Belief propagation estimation of protein and domain interactions using the sum-product algorithm
We present a novel framework to estimate protein-protein (PPI) and domain-domain (DDI) interactions based on a belief propagation estimation method that efficiently computes inter...
Faruck Morcos, Marcin Sikora, Mark S. Alber, Dale ...
TVCG
2008
95views more  TVCG 2008»
14 years 11 months ago
Improving the Readability of Clustered Social Networks using Node Duplication
Exploring communities is an important task in social network analysis. Such communities are currently identified using clustering methods to group actors. This approach often leads...
Nathalie Henry, Anastasia Bezerianos, Jean-Daniel ...