Sciweavers

753 search results - page 36 / 151
» Completing a (k - 1)-Assignment
Sort
View
DM
2010
128views more  DM 2010»
14 years 10 months ago
Some remarks on the geodetic number of a graph
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D. The geodetic number of G is the minimu...
Mitre Costa Dourado, Fábio Protti, Dieter R...
DAM
2008
131views more  DAM 2008»
14 years 10 months ago
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
Márcia R. Cerioli, L. Faria, T. O. Ferreira...
ENGL
2008
216views more  ENGL 2008»
14 years 10 months ago
Application of TLM and Cassie-Mayr Arc model on Transformer Aging and Incipient Faults Simulation
Abstract--The development of the transformer insulation failure undergoes three stages: insulation aging, incipient faults and a short circuit. This paper presents a complete schem...
X. Wang, Mark Sumner, D. W. P. Thomas
MCSS
2006
Springer
14 years 9 months ago
Optimal input sets for time minimality in quantized control systems
Abstract Limited capacity of communication channels has brought to the attention of many researchers the analysis of control systems subject to a quantized input set. In some funda...
Alessia Marigo
COMBINATORICS
2002
73views more  COMBINATORICS 2002»
14 years 9 months ago
Prefix Exchanging and Pattern Avoidance by Involutions
Let In() denote the number of involutions in the symmetric group Sn which avoid the permutation . We say that two permutations , Sj may be exchanged if for every n, k, and order...
Aaron D. Jaggard