Results 261 to 270 of about 36,227 (305)
Framework for <i>de novo</i> sequencing of peptide mixtures <i>via</i> network analysis and two-dimensional tandem mass spectrometry. [PDF]
Chem SciLe MT +5 more
europepmc +1 more source
A comparative analysis of topological domain callers over RNA-associated interactome. [PDF]
BMC BioinformaticsAlaygut T, Sefer E.
europepmc +1 more source
Potassium deficiency impairs photosynthetic induction via disrupted electron transport and photochemistry in <i>Phaseolus vulgaris</i>. [PDF]
Front Plant SciWu L, Luo Q, Zhu T, Wei Y.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On Partitional Labelings of Graphs
Mathematics in Computer Science, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rikio Ichishima, Akito Oshima
openaire +2 more sources
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, 2004
In this paper we consider the problem of (k, υ)-balanced graph partitioning - dividing the vertices of a graph into k almost equal size components (each of size less than υ • nk) so that the capacity of edges between different components is minimized. This problem is a natural generalization of several other problems such as minimum bisection, which is
Konstantin Andreev, Harald Räcke
openaire +1 more source
In this paper we consider the problem of (k, υ)-balanced graph partitioning - dividing the vertices of a graph into k almost equal size components (each of size less than υ • nk) so that the capacity of edges between different components is minimized. This problem is a natural generalization of several other problems such as minimum bisection, which is
Konstantin Andreev, Harald Räcke
openaire +1 more source
Combinatorics, Probability and Computing, 1996
In this paper, we prove that every graph contains a cycle intersecting all maximum independent sets. Using this, we further prove that every graph with stability number α is spanned by α disjoint cycles. Here, the empty set, the graph of order 1 and the path of order 2 are all considered as degenerate cycles.
Chen, C.C., Jin, G.P.
openaire +1 more source
In this paper, we prove that every graph contains a cycle intersecting all maximum independent sets. Using this, we further prove that every graph with stability number α is spanned by α disjoint cycles. Here, the empty set, the graph of order 1 and the path of order 2 are all considered as degenerate cycles.
Chen, C.C., Jin, G.P.
openaire +1 more source