Sciweavers

275 search results - page 23 / 55
» Component factors with large components in graphs
Sort
View
AC
2000
Springer
15 years 4 months ago
Graph-Theoretical Methods in Computer Vision
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
Ali Shokoufandeh, Sven J. Dickinson
ICNC
2005
Springer
15 years 5 months ago
Drawing Undirected Graphs with Genetic Algorithms
This paper proposes an improved genetic algorithm for producing aesthetically pleasing drawings of general undirected graphs. Previous undirected graph drawing algorithms draw larg...
Qing-Guo Zhang, Huayong Liu, Wei Zhang, Ya-Jun Guo
FASE
2009
Springer
15 years 6 months ago
Transformation of Type Graphs with Inheritance for Ensuring Security in E-Government Networks
Abstract. E-government services usually process large amounts of confidential data. Therefore, security requirements for the communication between components have to be adhered in...
Frank Hermann, Hartmut Ehrig, Claudia Ermel
SIGCOMM
2009
ACM
15 years 6 months ago
Beyond friendship graphs: a study of user interactions in Flickr
Most of the existing literature on empirical studies of Online Social Networks (OSNs) have focused on characterizing and modeling the structure of their inferred friendship graphs...
Masoud Valafar, Reza Rejaie, Walter Willinger
CP
2004
Springer
15 years 5 months ago
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Haixia Jia, Cristopher Moore