Results 271 to 280 of about 622,161 (318)
Nickel-catalyzed CNTs enhancing cycle performance of Si@C anodes. [PDF]
RSC AdvWang Z +11 more
europepmc +1 more source
Engineering a redox-active interface for highly reversible aluminum anode-based practical all-solid-state lithium batteries with ultralow N/P ratio. [PDF]
Chem SciCui J +10 more
europepmc +1 more source
Maternal History of Weight Loss and Prospective Gestational Weight Gain.
JAMA Netw OpenMuse ME +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Graphs and Combinatorics, 2001
For each vertex \(v\) in a graph \(G\), the maximum length of a cycle which passes through \(v\) is called the cycle number of \(v\), denoted by \(c(v)\). A sequence \(a_1,a_2,\dots,a_n\) of nonnegetive integers is called a cycle sequence of a graph \(G\) if the vertices of \(G\) can be labeled as \(v_1,v_2,\dots,v_n\) such that \(a_i=c(v_i)\) for \(1 ...
Ko-Wei Lih, Li-Da Tong, Jing-Ho Yan
openaire +1 more source
For each vertex \(v\) in a graph \(G\), the maximum length of a cycle which passes through \(v\) is called the cycle number of \(v\), denoted by \(c(v)\). A sequence \(a_1,a_2,\dots,a_n\) of nonnegetive integers is called a cycle sequence of a graph \(G\) if the vertices of \(G\) can be labeled as \(v_1,v_2,\dots,v_n\) such that \(a_i=c(v_i)\) for \(1 ...
Ko-Wei Lih, Li-Da Tong, Jing-Ho Yan
openaire +1 more source
Cladistics, 1997
Intended to support three‐taxon analysis (3ta), the proposal that all character states be regarded as terminal would instead undercut that method. The same is true of the idea that cladistic methods should not account for plesiomorphies. Parsimony does not correspond to interpretation 1 for incompletely resolved cladograms.
openaire +2 more sources
Intended to support three‐taxon analysis (3ta), the proposal that all character states be regarded as terminal would instead undercut that method. The same is true of the idea that cladistic methods should not account for plesiomorphies. Parsimony does not correspond to interpretation 1 for incompletely resolved cladograms.
openaire +2 more sources
Journal of Economic Theory, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bramoullé, Yann, Saint-Paul, Gilles
openaire +5 more sources
2005
This chapter is concerned with approaches and techniques used in studying those aspects of parasitoid and predator life cycles that have an important bearing on the major topics covered by other chapters in this book. To illustrate what we mean, consider the female reproductive system of parasitoids which we discuss in some detail (section 2.3).
Jervis, M.A. +2 more
openaire +2 more sources
This chapter is concerned with approaches and techniques used in studying those aspects of parasitoid and predator life cycles that have an important bearing on the major topics covered by other chapters in this book. To illustrate what we mean, consider the female reproductive system of parasitoids which we discuss in some detail (section 2.3).
Jervis, M.A. +2 more
openaire +2 more sources
2019
Dynastic cycles have been recognized for thousands of years, and a comprehensive theory explaining them was developed by Ibn Khaldun of North Africa in the fourteenth century. Recently updated by Peter Turchin, it has shown predictive power. In a typical cycle, a successful leader unites followers, conquers the country, and founds a dynasty. Over time,
openaire +1 more source
Dynastic cycles have been recognized for thousands of years, and a comprehensive theory explaining them was developed by Ibn Khaldun of North Africa in the fourteenth century. Recently updated by Peter Turchin, it has shown predictive power. In a typical cycle, a successful leader unites followers, conquers the country, and founds a dynasty. Over time,
openaire +1 more source
2005
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/or length of the covering cycles. In particular, we give a (1+ln 2)-approximation for the lane covering problem [3,4] in weighted graphs with metric lengths on the edges and an
Nicole Immorlica +2 more
openaire +1 more source
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/or length of the covering cycles. In particular, we give a (1+ln 2)-approximation for the lane covering problem [3,4] in weighted graphs with metric lengths on the edges and an
Nicole Immorlica +2 more
openaire +1 more source
Order, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter C. Fishburn, Douglas R. Woodall
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter C. Fishburn, Douglas R. Woodall
openaire +2 more sources