4009 search results - page 747 / 802 » Clustering on Complex Graphs |
128
click to vote
COCOON
2009
Springer
15 years 10 months ago
2009
Springer
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...
155
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
160
click to vote
IWCIA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
152
click to vote
ASPDAC
2009
ACM
15 years 10 months ago
2009
ACM
—Reversible logic studies have promising potential on energy lossless circuit design, quantum computation, nanotechnology, etc. Reversible logic features a one-to-one input outpu...
133
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...