Sciweavers

2612 search results - page 14 / 523
» Switching Graphs and Their Complexity
Sort
View
ISAAC
2004
Springer
141views Algorithms» more  ISAAC 2004»
14 years 3 months ago
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
Jérôme Monnot, Vangelis Th. Paschos, ...
DM
2011
264views Education» more  DM 2011»
13 years 4 months ago
Connectivity threshold and recovery time in rank-based models for complex networks
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
Pawel Pralat
ISCC
2008
IEEE
14 years 4 months ago
A Partially Buffered Crossbar packet switching architecture and its scheduling
The crossbar fabric is widely used as the interconnect of high-performance packet switches due to its low cost and scalability. There are two main variants of the crossbar fabric:...
Lotfi Mhamdi
GG
2008
Springer
13 years 11 months ago
Network Applications of Graph Bisimulation
Abstract Synchronising Graphs is a system of parallel graph transformation designed for modeling process interaction in a network environment. We propose a theory of context-free s...
Pietro Cenciarelli, Daniele Gorla, Emilio Tuosto
ISCAS
2003
IEEE
90views Hardware» more  ISCAS 2003»
14 years 3 months ago
A reduction technique of large scale RCG interconnects in complex frequency domain
High frequency digital LSIs usually consist of many subcircuits coupled with multi-conductor interconnects embedded in the substrate. They sometimes cause serious problems of the ...
Yoshihiro Yamagami, Yoshifumi Nishio, Atsumi Hatto...