Sciweavers

595 search results - page 45 / 119
» Incidence of
Sort
View
NETWORKS
2006
13 years 8 months ago
A bidirected generalization of network matrices
We define binet matrices, which furnish a direct generalization of totally unimodular network matrices and arise from the node-edge incidence matrices of bidirected graphs in the ...
Gautam Appa, Balázs Kotnyek
IPL
2007
114views more  IPL 2007»
13 years 8 months ago
Spanning trees with minimum weighted degrees
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Sha...
JCSC
1998
227views more  JCSC 1998»
13 years 8 months ago
Continuous and Hybrid Petri Nets
: Continuous and hybrid Petri nets can be seen as relaxation of discrete nets, in which the firing of some or of all transitions is approximated with a fluid model. Several analysi...
Hassane Alla, René David
IJUFKS
2010
97views more  IJUFKS 2010»
13 years 7 months ago
A Class of Poverty Measures Induced by the Dual Decomposition of Aggregation Functions
In this paper we introduce a new family of poverty measures for comparing and ordering social situations. The aggregation scheme of these poverty measures is based on the oneparam...
José Luis García-Lapresta, Casilda L...
IPL
2010
160views more  IPL 2010»
13 years 7 months ago
Antimagic labeling and canonical decomposition of graphs
An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1, . . . , m} to the edges such that the sums of incident labels are distinct at...
Michael D. Barrus