Results 261 to 270 of about 227,714 (275)
Advanced NanoBiomed Research, EarlyView.Biomimetic microdevices are redefining anticancer drug screening by mimicking complex tumor microenvironments. This review highlights advances in microfluidic systems, cell microarrays, and in vivo‐like models, offering new insights into drug efficacy prediction and personalized medicine. The development of effective anticancer drugs remains a critical
Ching‐Te Kuo +2 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Spanning Trees and Arborescences
2000Consider a telephone company that wants to rent a subset from an existing set of cables, each of which connects two cities. The rented cables should suffice to connect all cities and they should be as cheap as possible. It is natural to model the network by a graph: the vertices are the cities and the edges correspond to the cables.
Bernhard Korte, Jens Vygen
openaire +2 more sources
Tunable survivable spanning trees
ACM SIGMETRICS Performance Evaluation Review, 2014Coping with network failures has become a major networking challenge. The concept of tunable survivability provides a quantitative measure for specifying any desired level (0%-100%) of survivability, thus offering flexibility in the routing choice. Previous works focused on implementing this concept on unicast transmissions. However, vital
Ori Rottenstreich +2 more
openaire +3 more sources
On the diameters of spanning trees [PDF]
IEEE Transactions on Circuits and Systems, 1985 The tree-diameter set of a connected graph G is the set of all diameters of the spanning trees of G , written in the increasing order. A relation between the consecutive elements of this set is obtained and it is shown to be the best possible. A sufficient condition for a set to be a feasible tree-diameter set is given and this solves a conjecture by ...
V. Krishnamoorthy, V. Sankaran
openaire +1 more source
Information Processing Letters, 1992
Abstract We prove that if any k-vertex connected graph has k vertex independent spanning trees, then any k-edge connected graph has k edge independent spanning trees. Thus, answering a question raised by Zehavi and Itai [J. Graph Theory 13 (1989)] in the affirmative.
Samir Khuller, Baruch Schieber
openaire +2 more sources
Abstract We prove that if any k-vertex connected graph has k vertex independent spanning trees, then any k-edge connected graph has k edge independent spanning trees. Thus, answering a question raised by Zehavi and Itai [J. Graph Theory 13 (1989)] in the affirmative.
Samir Khuller, Baruch Schieber
openaire +2 more sources
Counting Spanning Trees to Guide Search in Constrained Spanning Tree Problems
2013Counting-based branching heuristics such as maxSD were shown to be effective on a variety of constraint satisfaction problems. These heuristics require that we equip each family of constraints with a dedicated algorithm to compute the local solution density of variable assignments, much as what has been done with filtering algorithms to apply local ...
Louis-Martin Rousseau +2 more
openaire +2 more sources
Graphs and Combinatorics, 2010
In this paper, we give a survey of spanning trees. We mainly deal with spanning trees having some particular properties concerning a hamiltonian properties, for example, spanning trees with bounded degree, with bounded number of leaves, or with bounded number of branch vertices.
Kenta Ozeki, Tomoki Yamashita
openaire +2 more sources
In this paper, we give a survey of spanning trees. We mainly deal with spanning trees having some particular properties concerning a hamiltonian properties, for example, spanning trees with bounded degree, with bounded number of leaves, or with bounded number of branch vertices.
Kenta Ozeki, Tomoki Yamashita
openaire +2 more sources
International Journal of Foundations of Computer Science, 2013
Combinatorial Optimization is combined with Social Choice Theory when the goal is to decide on the quality of a spanning tree of an undirected graph. Given individual preferences over the edges of the graph, spanning trees are compared by means of a Condorcet criterion.
openaire +2 more sources
Combinatorial Optimization is combined with Social Choice Theory when the goal is to decide on the quality of a spanning tree of an undirected graph. Given individual preferences over the edges of the graph, spanning trees are compared by means of a Condorcet criterion.
openaire +2 more sources
2013
A minimum spanning tree of a weighted graph is its spanning tree T with a minimum total cost of edges in T of all possible spanning trees. Minimum spanning trees have many applications in computer networks. In this chapter, we investigate synchronous and asynchronous distributed algorithms to construct minimum spanning trees.
openaire +2 more sources
A minimum spanning tree of a weighted graph is its spanning tree T with a minimum total cost of edges in T of all possible spanning trees. Minimum spanning trees have many applications in computer networks. In this chapter, we investigate synchronous and asynchronous distributed algorithms to construct minimum spanning trees.
openaire +2 more sources