Sciweavers

684 search results - page 30 / 137
» A characterization of b-perfect graphs
Sort
View
132
Voted
IWANN
2005
Springer
15 years 7 months ago
Characterizing Self-developing Biological Neural Networks: A First Step Towards Their Application to Computing Systems
Carbon nanotubes are often seen as the only alternative technology to silicon transistors. While they are the most likely short-term alternative, other longer-term alternatives sho...
Hugues Berry, Olivier Temam
EJC
2011
14 years 8 months ago
Matching and edge-connectivity in regular graphs
Henning and Yeo proved a lower bound for the minimum size of a maximum matching in a connected k-regular graphs with n vertices; it is sharp infinitely often. In an earlier paper...
Suil O, Douglas B. West
MICS
2010
124views more  MICS 2010»
14 years 8 months ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger
WWW
2003
ACM
16 years 2 months ago
Data-Sharing Relationships in the Web
We propose a novel structure, the data-sharing graph, for characterizing sharing patterns in large-scale data distribution systems. We analyze this structure in two such systems a...
Adriana Iamnitchi, Matei Ripeanu, Ian T. Foster
ISHPC
2003
Springer
15 years 7 months ago
Chordal Topologies for Interconnection Networks
Abstract. The class of dense circulant graphs of degree four with optimal distance-related properties is analyzed in this paper. An algebraic study of this class is done. Two geome...
Ramón Beivide, Carmen Martínez, Cruz...