Sciweavers

496 search results - page 59 / 100
» C4-saturated bipartite graphs
Sort
View
WG
2004
Springer
14 years 2 months ago
The Computational Complexity of the Minimum Weight Processor Assignment Problem
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
Hajo Broersma, Daniël Paulusma, Gerard J. M. ...
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 8 months ago
Network synchronizability analysis: the theory of subgraphs and complementary graphs
In this paper, subgraphs and complementary graphs are used to analyze network synchronizability. Some sharp and attainable bounds are derived for the eigenratio of the network str...
Zhisheng Duan, Chao Liu, Guanrong Chen
IPL
2010
115views more  IPL 2010»
13 years 7 months ago
Hardness and approximation of minimum distortion embeddings
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
Pinar Heggernes, Daniel Meister
CPC
2007
61views more  CPC 2007»
13 years 9 months ago
Maximizing Several Cuts Simultaneously
Consider two graphs G1 and G2 on the same vertex set V and suppose that Gi has mi edges. Then there is a bipartition of V into two classes A and B so that for both i = 1, 2 we hav...
Daniela Kühn, Deryk Osthus
ENDM
2010
103views more  ENDM 2010»
13 years 6 months ago
Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets
In this paper we consider the structural analysis problem for differential-algebraic systems with conditional equations. This consists, given a conditional differential algebraic ...
Mathieu Lacroix, Ali Ridha Mahjoub, Sébasti...