Matches in SemOpenAlex for { <https://semopenalex.org/work/W2166201119> ?p ?o ?g. }
Showing items 1 to 63 of
63
with 100 items per page.
- W2166201119 abstract "Let G be any directed graph and S be nonnegative and non-decreasing integer sequence(s). The prescribed degree sequence problem is a problem to determine whether there is a graph G with S as the prescribed sequence(s) of outdegrees of the vertices. Let G be the property satisfying the following (1) and (2): (1) G has two disjoint vertex sets A and B; (2) For every vertex pair u, v isin G (u ne v), (G satisfies |{uv}| + |{vu}|) = {( (r <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>11</sub> if u, v isin A) (r <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>12</sub> if u isin A, v isin B) (r <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>22</sub> if u, v isin B)), where uv (vu, respectively) means a directed edges from u to v (from v to u). Then G is called an (r <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>11</sub> , r <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>12</sub> , r <sub xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>22</sub> )-tournament (tournament, for short). When G is a tournament, the prescribed degree sequence problem is called the score sequence pair problem of a tournament, and S is called a score sequence pair of a tournament (or S is realizable) if the answer is yes. We proposed the characterizations of a tournament and an algorithm for determining in linear time whether a pair of two integer sequences is realizable or not (Takahashi et al., 2006). In this paper, we propose an algorithm for constructing a tournament from such a score sequence pair." @default.
- W2166201119 created "2016-06-24" @default.
- W2166201119 creator A5052113389 @default.
- W2166201119 creator A5071298407 @default.
- W2166201119 creator A5079132507 @default.
- W2166201119 date "2007-05-01" @default.
- W2166201119 modified "2023-09-26" @default.
- W2166201119 title "Construction of an (r11, r12, r22)-Tournament from a Score Sequence Pair" @default.
- W2166201119 cites W1996568793 @default.
- W2166201119 cites W2037100948 @default.
- W2166201119 cites W2796976177 @default.
- W2166201119 cites W2799004609 @default.
- W2166201119 cites W413394676 @default.
- W2166201119 doi "https://doi.org/10.1109/iscas.2007.378298" @default.
- W2166201119 hasPublicationYear "2007" @default.
- W2166201119 type Work @default.
- W2166201119 sameAs 2166201119 @default.
- W2166201119 citedByCount "0" @default.
- W2166201119 crossrefType "proceedings-article" @default.
- W2166201119 hasAuthorship W2166201119A5052113389 @default.
- W2166201119 hasAuthorship W2166201119A5071298407 @default.
- W2166201119 hasAuthorship W2166201119A5079132507 @default.
- W2166201119 hasConcept C114614502 @default.
- W2166201119 hasConcept C118615104 @default.
- W2166201119 hasConcept C132525143 @default.
- W2166201119 hasConcept C136975688 @default.
- W2166201119 hasConcept C154945302 @default.
- W2166201119 hasConcept C2778112365 @default.
- W2166201119 hasConcept C33923547 @default.
- W2166201119 hasConcept C41008148 @default.
- W2166201119 hasConcept C45340560 @default.
- W2166201119 hasConcept C54355233 @default.
- W2166201119 hasConcept C80899671 @default.
- W2166201119 hasConcept C86803240 @default.
- W2166201119 hasConceptScore W2166201119C114614502 @default.
- W2166201119 hasConceptScore W2166201119C118615104 @default.
- W2166201119 hasConceptScore W2166201119C132525143 @default.
- W2166201119 hasConceptScore W2166201119C136975688 @default.
- W2166201119 hasConceptScore W2166201119C154945302 @default.
- W2166201119 hasConceptScore W2166201119C2778112365 @default.
- W2166201119 hasConceptScore W2166201119C33923547 @default.
- W2166201119 hasConceptScore W2166201119C41008148 @default.
- W2166201119 hasConceptScore W2166201119C45340560 @default.
- W2166201119 hasConceptScore W2166201119C54355233 @default.
- W2166201119 hasConceptScore W2166201119C80899671 @default.
- W2166201119 hasConceptScore W2166201119C86803240 @default.
- W2166201119 hasLocation W21662011191 @default.
- W2166201119 hasOpenAccess W2166201119 @default.
- W2166201119 hasPrimaryLocation W21662011191 @default.
- W2166201119 hasRelatedWork W1705888004 @default.
- W2166201119 hasRelatedWork W2054453791 @default.
- W2166201119 hasRelatedWork W2078497632 @default.
- W2166201119 hasRelatedWork W2397412345 @default.
- W2166201119 hasRelatedWork W2535689316 @default.
- W2166201119 hasRelatedWork W2770134917 @default.
- W2166201119 hasRelatedWork W2783744144 @default.
- W2166201119 hasRelatedWork W3185918591 @default.
- W2166201119 hasRelatedWork W4285483598 @default.
- W2166201119 hasRelatedWork W4295200555 @default.
- W2166201119 isParatext "false" @default.
- W2166201119 isRetracted "false" @default.
- W2166201119 magId "2166201119" @default.
- W2166201119 workType "article" @default.