5606 search results - page 164 / 1122 » Randomization Techniques for Graphs. |
CPC
2002
15 years 13 days ago
2002
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
96
Voted
RSA
2008
15 years 3 days ago
2008
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
83
Voted
ISI
2007
Springer
15 years 6 months ago
2007
Springer
Graph data represents relationships, connections, or affinities. Innocent relationships produce repeated, and so common, substructures in graph data. We present techniques for dis...
98
Voted
MFCS
2009
Springer
15 years 5 months ago
2009
Springer
In this paper we first explore the group theoretic techniques developed for graph isomorphism. We specifically discuss the techniques developed by Luks for solving constrained v...
118
click to vote
COMPSAC
2009
IEEE
15 years 5 months ago
2009
IEEE
—In continuous integration, a tight integration of test case prioritization techniques and fault-localization techniques may both expose failures faster and locate faults more ef...