|
|
|
|
|
Jie Liu and Jinglei Liu
Conditional preference networks (CP-nets) are recently an emerging topic as a graphical model for compactly representing ordinal conditional preference relations on multi-attribute domains. As we know, the treewidth, which can decrease the solving comple...
ver más
|
|
|
|
|
|
|
|
|
|
|
Marcos E. González Laffitte and Peter F. Stadler
The comparison of multiple (labeled) graphs with unrelated vertex sets is an important task in diverse areas of applications. Conceptually, it is often closely related to multiple sequence alignments since one aims to determine a correspondence, or more ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Agostinho Agra and Jose Maria Samuco
Given a social network modelled by a graph, the goal of the influence maximization problem is to find k vertices that maximize the number of active vertices through a process of diffusion. For this diffusion, the linear threshold model is considered. A n...
ver más
|
|
|
|
|
|
|
|
|
|
|
Patrick Meyer, Sebastian Lück, Tobias Spuhler, Christoph Bode, Christian Hühne, Jens Friedrichs and Michael Sinapius
High aspect ratio aircraft have a significantly reduced induced drag, but have only limited installation space for control surfaces near the wingtip. This paper describes a multidisciplinary design methodology for a morphing aileron that is based on pres...
ver más
|
|
|
|
|
|
|
|
|
|
|
L. Rubio,M. Rodríguez-Freire,M.C. Mateo-Sánchez,C. Estreguil,S. Saura
Pág. 223 - 235
Managing forest landscapes to sustain functional connectivity is considered one of the key strategies to counteract the negative effects of climate and human-induced changes in forest species pools. With this objective, we evaluated whether a robust netw...
ver más
|
|
|
|
|
|
|
|
|
|
|
Serafino Cicerone
Cicerone and Di Stefano defined and studied the class of k-distance-hereditary graphs, i.e., graphs where the distance in each connected induced subgraph is at most k times the distance in the whole graph. The defined graphs represent a generalization of...
ver más
|
|
|
|
|
|
|
|
|
|
|
Patrizio Angelini, Peter Eades, Seok-Hee Hong, Karsten Klein, Stephen Kobourov, Giuseppe Liotta, Alfredo Navarra and Alessandra Tappini
This paper introduces and studies the following beyond-planarity problem, which we call h-Clique2Path Planarity. Let G be a simple topological graph whose vertices are partitioned into subsets of size at most h, each inducing a clique. h-Clique2Path Plan...
ver más
|
|
|
|
|
|
|
|
|
|
|
Miroslaw Kowaluk and Andrzej Lingas
We introduce the concept of a k-dimensional matrix product D of k matrices A1,…,Ak" role="presentation">??1,?,????A1,?,Ak
A
1
,
?
,
A
k
of sizes n1×n,…,nk×n," role="presentation">??1×??,?,????×??,n1×n,?,nk×n,
n
1
...
ver más
|
|
|
|
|
|
|
|
|
|
|
Vittorio Bilò, Michele Flammini, Vasco Gallotti and Cosimo Vinci
We introduce multidimensional congestion games, that is, congestion games whose set of players is partitioned into ??+1
d
+
1
clusters ??0,??1,?,????
C
0
,
C
1
,
?
,
C
d
. Players in ??0
C
0
have full information about all the other participants in the...
ver más
|
|
|
|
|
|