Graph grabbing game on totally-weighted graphs
The graph grabbing game is a two-player game on a connected graph with a vertex-weight function. In the game, they alternately remove a non-cut vertex from the graph (i.e., the resulting graph remains connected) and get the weight assigned to the vertex. Each player’s aim is to maximize his or her o...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Matsumoto, Naoki [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2022transfer abstract |
|---|
| Schlagwörter: |
|---|
| Umfang: |
7 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures - Miguel, F.L. ELSEVIER, 2013transfer abstract, [S.l.] |
|---|---|
| Übergeordnetes Werk: |
volume:322 ; year:2022 ; day:15 ; month:12 ; pages:384-390 ; extent:7 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.dam.2022.09.007 |
|---|
| Katalog-ID: |
ELV059132264 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV059132264 | ||
| 003 | DE-627 | ||
| 005 | 20230626052259.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 221103s2022 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.dam.2022.09.007 |2 doi | |
| 028 | 5 | 2 | |a /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001936.pica |
| 035 | |a (DE-627)ELV059132264 | ||
| 035 | |a (ELSEVIER)S0166-218X(22)00354-7 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 070 |q VZ |
| 082 | 0 | 4 | |a 660 |q VZ |
| 082 | 0 | 4 | |a 333.7 |a 610 |q VZ |
| 084 | |a 43.12 |2 bkl | ||
| 084 | |a 43.13 |2 bkl | ||
| 084 | |a 44.13 |2 bkl | ||
| 100 | 1 | |a Matsumoto, Naoki |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Graph grabbing game on totally-weighted graphs |
| 264 | 1 | |c 2022transfer abstract | |
| 300 | |a 7 | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a The graph grabbing game is a two-player game on a connected graph with a vertex-weight function. In the game, they alternately remove a non-cut vertex from the graph (i.e., the resulting graph remains connected) and get the weight assigned to the vertex. Each player’s aim is to maximize his or her outcome, when all vertices have been taken. In this paper, we consider the graph grabbing game on totally-weighted graphs that are graphs with weight functions from a set of elements in the vertex set and the edge set to non-negative real numbers. In this version, when a player removes a non-cut vertex v , that player gets the weight of v plus the total weight assigned to the edges incident to v . In particular, we give some results of interest for the graph grabbing game on edge-weighted trees, i.e., every vertex has weight zero. Moreover, we consider the game on edge-weighed graphs in the altered rule that each player must keep the connectedness of graphs induced by edges. | ||
| 520 | |a The graph grabbing game is a two-player game on a connected graph with a vertex-weight function. In the game, they alternately remove a non-cut vertex from the graph (i.e., the resulting graph remains connected) and get the weight assigned to the vertex. Each player’s aim is to maximize his or her outcome, when all vertices have been taken. In this paper, we consider the graph grabbing game on totally-weighted graphs that are graphs with weight functions from a set of elements in the vertex set and the edge set to non-negative real numbers. In this version, when a player removes a non-cut vertex v , that player gets the weight of v plus the total weight assigned to the edges incident to v . In particular, we give some results of interest for the graph grabbing game on edge-weighted trees, i.e., every vertex has weight zero. Moreover, we consider the game on edge-weighed graphs in the altered rule that each player must keep the connectedness of graphs induced by edges. | ||
| 650 | 7 | |a Edge-weighted graph |2 Elsevier | |
| 650 | 7 | |a Totally-weighted graph |2 Elsevier | |
| 650 | 7 | |a Graph grabbing game |2 Elsevier | |
| 650 | 7 | |a Tree |2 Elsevier | |
| 700 | 1 | |a Moriyama, Ryusei |4 oth | |
| 700 | 1 | |a Ota, Katsuhiro |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |n Elsevier |a Miguel, F.L. ELSEVIER |t Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures |d 2013transfer abstract |g [S.l.] |w (DE-627)ELV011300345 |
| 773 | 1 | 8 | |g volume:322 |g year:2022 |g day:15 |g month:12 |g pages:384-390 |g extent:7 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.dam.2022.09.007 |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a GBV_ELV | ||
| 912 | |a SYSFLAG_U | ||
| 912 | |a SSG-OLC-PHA | ||
| 912 | |a SSG-OPC-GGO | ||
| 912 | |a GBV_ILN_20 | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_30 | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_130 | ||
| 936 | b | k | |a 43.12 |j Umweltchemie |q VZ |
| 936 | b | k | |a 43.13 |j Umwelttoxikologie |q VZ |
| 936 | b | k | |a 44.13 |j Medizinische Ökologie |q VZ |
| 951 | |a AR | ||
| 952 | |d 322 |j 2022 |b 15 |c 1215 |h 384-390 |g 7 | ||
| author_variant |
n m nm |
|---|---|
| matchkey_str |
matsumotonaokimoriyamaryuseiotakatsuhiro:2022----:rpgabngmottlyeg |
| hierarchy_sort_str |
2022transfer abstract |
| bklnumber |
43.12 43.13 44.13 |
| publishDate |
2022 |
| allfields |
10.1016/j.dam.2022.09.007 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001936.pica (DE-627)ELV059132264 (ELSEVIER)S0166-218X(22)00354-7 DE-627 ger DE-627 rakwb eng 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Matsumoto, Naoki verfasserin aut Graph grabbing game on totally-weighted graphs 2022transfer abstract 7 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier The graph grabbing game is a two-player game on a connected graph with a vertex-weight function. In the game, they alternately remove a non-cut vertex from the graph (i.e., the resulting graph remains connected) and get the weight assigned to the vertex. Each player’s aim is to maximize his or her outcome, when all vertices have been taken. In this paper, we consider the graph grabbing game on totally-weighted graphs that are graphs with weight functions from a set of elements in the vertex set and the edge set to non-negative real numbers. In this version, when a player removes a non-cut vertex v , that player gets the weight of v plus the total weight assigned to the edges incident to v . In particular, we give some results of interest for the graph grabbing game on edge-weighted trees, i.e., every vertex has weight zero. Moreover, we consider the game on edge-weighed graphs in the altered rule that each player must keep the connectedness of graphs induced by edges. The graph grabbing game is a two-player game on a connected graph with a vertex-weight function. In the game, they alternately remove a non-cut vertex from the graph (i.e., the resulting graph remains connected) and get the weight assigned to the vertex. Each player’s aim is to maximize his or her outcome, when all vertices have been taken. In this paper, we consider the graph grabbing game on totally-weighted graphs that are graphs with weight functions from a set of elements in the vertex set and the edge set to non-negative real numbers. In this version, when a player removes a non-cut vertex v , that player gets the weight of v plus the total weight assigned to the edges incident to v . In particular, we give some results of interest for the graph grabbing game on edge-weighted trees, i.e., every vertex has weight zero. Moreover, we consider the game on edge-weighed graphs in the altered rule that each player must keep the connectedness of graphs induced by edges. Edge-weighted graph Elsevier Totally-weighted graph Elsevier Graph grabbing game Elsevier Tree Elsevier Moriyama, Ryusei oth Ota, Katsuhiro oth Enthalten in Elsevier Miguel, F.L. ELSEVIER Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures 2013transfer abstract [S.l.] (DE-627)ELV011300345 volume:322 year:2022 day:15 month:12 pages:384-390 extent:7 https://doi.org/10.1016/j.dam.2022.09.007 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA SSG-OPC-GGO GBV_ILN_20 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_130 43.12 Umweltchemie VZ 43.13 Umwelttoxikologie VZ 44.13 Medizinische Ökologie VZ AR 322 2022 15 1215 384-390 7 |
| spelling |
10.1016/j.dam.2022.09.007 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001936.pica (DE-627)ELV059132264 (ELSEVIER)S0166-218X(22)00354-7 DE-627 ger DE-627 rakwb eng 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Matsumoto, Naoki verfasserin aut Graph grabbing game on totally-weighted graphs 2022transfer abstract 7 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier The graph grabbing game is a two-player game on a connected graph with a vertex-weight function. In the game, they alternately remove a non-cut vertex from the graph (i.e., the resulting graph remains connected) and get the weight assigned to the vertex. Each player’s aim is to maximize his or her outcome, when all vertices have been taken. In this paper, we consider the graph grabbing game on totally-weighted graphs that are graphs with weight functions from a set of elements in the vertex set and the edge set to non-negative real numbers. In this version, when a player removes a non-cut vertex v , that player gets the weight of v plus the total weight assigned to the edges incident to v . In particular, we give some results of interest for the graph grabbing game on edge-weighted trees, i.e., every vertex has weight zero. Moreover, we consider the game on edge-weighed graphs in the altered rule that each player must keep the connectedness of graphs induced by edges. The graph grabbing game is a two-player game on a connected graph with a vertex-weight function. In the game, they alternately remove a non-cut vertex from the graph (i.e., the resulting graph remains connected) and get the weight assigned to the vertex. Each player’s aim is to maximize his or her outcome, when all vertices have been taken. In this paper, we consider the graph grabbing game on totally-weighted graphs that are graphs with weight functions from a set of elements in the vertex set and the edge set to non-negative real numbers. In this version, when a player removes a non-cut vertex v , that player gets the weight of v plus the total weight assigned to the edges incident to v . In particular, we give some results of interest for the graph grabbing game on edge-weighted trees, i.e., every vertex has weight zero. Moreover, we consider the game on edge-weighed graphs in the altered rule that each player must keep the connectedness of graphs induced by edges. Edge-weighted graph Elsevier Totally-weighted graph Elsevier Graph grabbing game Elsevier Tree Elsevier Moriyama, Ryusei oth Ota, Katsuhiro oth Enthalten in Elsevier Miguel, F.L. ELSEVIER Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures 2013transfer abstract [S.l.] (DE-627)ELV011300345 volume:322 year:2022 day:15 month:12 pages:384-390 extent:7 https://doi.org/10.1016/j.dam.2022.09.007 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA SSG-OPC-GGO GBV_ILN_20 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_130 43.12 Umweltchemie VZ 43.13 Umwelttoxikologie VZ 44.13 Medizinische Ökologie VZ AR 322 2022 15 1215 384-390 7 |
| allfields_unstemmed |
10.1016/j.dam.2022.09.007 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001936.pica (DE-627)ELV059132264 (ELSEVIER)S0166-218X(22)00354-7 DE-627 ger DE-627 rakwb eng 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Matsumoto, Naoki verfasserin aut Graph grabbing game on totally-weighted graphs 2022transfer abstract 7 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier The graph grabbing game is a two-player game on a connected graph with a vertex-weight function. In the game, they alternately remove a non-cut vertex from the graph (i.e., the resulting graph remains connected) and get the weight assigned to the vertex. Each player’s aim is to maximize his or her outcome, when all vertices have been taken. In this paper, we consider the graph grabbing game on totally-weighted graphs that are graphs with weight functions from a set of elements in the vertex set and the edge set to non-negative real numbers. In this version, when a player removes a non-cut vertex v , that player gets the weight of v plus the total weight assigned to the edges incident to v . In particular, we give some results of interest for the graph grabbing game on edge-weighted trees, i.e., every vertex has weight zero. Moreover, we consider the game on edge-weighed graphs in the altered rule that each player must keep the connectedness of graphs induced by edges. The graph grabbing game is a two-player game on a connected graph with a vertex-weight function. In the game, they alternately remove a non-cut vertex from the graph (i.e., the resulting graph remains connected) and get the weight assigned to the vertex. Each player’s aim is to maximize his or her outcome, when all vertices have been taken. In this paper, we consider the graph grabbing game on totally-weighted graphs that are graphs with weight functions from a set of elements in the vertex set and the edge set to non-negative real numbers. In this version, when a player removes a non-cut vertex v , that player gets the weight of v plus the total weight assigned to the edges incident to v . In particular, we give some results of interest for the graph grabbing game on edge-weighted trees, i.e., every vertex has weight zero. Moreover, we consider the game on edge-weighed graphs in the altered rule that each player must keep the connectedness of graphs induced by edges. Edge-weighted graph Elsevier Totally-weighted graph Elsevier Graph grabbing game Elsevier Tree Elsevier Moriyama, Ryusei oth Ota, Katsuhiro oth Enthalten in Elsevier Miguel, F.L. ELSEVIER Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures 2013transfer abstract [S.l.] (DE-627)ELV011300345 volume:322 year:2022 day:15 month:12 pages:384-390 extent:7 https://doi.org/10.1016/j.dam.2022.09.007 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA SSG-OPC-GGO GBV_ILN_20 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_130 43.12 Umweltchemie VZ 43.13 Umwelttoxikologie VZ 44.13 Medizinische Ökologie VZ AR 322 2022 15 1215 384-390 7 |
| allfieldsGer |
10.1016/j.dam.2022.09.007 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001936.pica (DE-627)ELV059132264 (ELSEVIER)S0166-218X(22)00354-7 DE-627 ger DE-627 rakwb eng 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Matsumoto, Naoki verfasserin aut Graph grabbing game on totally-weighted graphs 2022transfer abstract 7 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier The graph grabbing game is a two-player game on a connected graph with a vertex-weight function. In the game, they alternately remove a non-cut vertex from the graph (i.e., the resulting graph remains connected) and get the weight assigned to the vertex. Each player’s aim is to maximize his or her outcome, when all vertices have been taken. In this paper, we consider the graph grabbing game on totally-weighted graphs that are graphs with weight functions from a set of elements in the vertex set and the edge set to non-negative real numbers. In this version, when a player removes a non-cut vertex v , that player gets the weight of v plus the total weight assigned to the edges incident to v . In particular, we give some results of interest for the graph grabbing game on edge-weighted trees, i.e., every vertex has weight zero. Moreover, we consider the game on edge-weighed graphs in the altered rule that each player must keep the connectedness of graphs induced by edges. The graph grabbing game is a two-player game on a connected graph with a vertex-weight function. In the game, they alternately remove a non-cut vertex from the graph (i.e., the resulting graph remains connected) and get the weight assigned to the vertex. Each player’s aim is to maximize his or her outcome, when all vertices have been taken. In this paper, we consider the graph grabbing game on totally-weighted graphs that are graphs with weight functions from a set of elements in the vertex set and the edge set to non-negative real numbers. In this version, when a player removes a non-cut vertex v , that player gets the weight of v plus the total weight assigned to the edges incident to v . In particular, we give some results of interest for the graph grabbing game on edge-weighted trees, i.e., every vertex has weight zero. Moreover, we consider the game on edge-weighed graphs in the altered rule that each player must keep the connectedness of graphs induced by edges. Edge-weighted graph Elsevier Totally-weighted graph Elsevier Graph grabbing game Elsevier Tree Elsevier Moriyama, Ryusei oth Ota, Katsuhiro oth Enthalten in Elsevier Miguel, F.L. ELSEVIER Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures 2013transfer abstract [S.l.] (DE-627)ELV011300345 volume:322 year:2022 day:15 month:12 pages:384-390 extent:7 https://doi.org/10.1016/j.dam.2022.09.007 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA SSG-OPC-GGO GBV_ILN_20 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_130 43.12 Umweltchemie VZ 43.13 Umwelttoxikologie VZ 44.13 Medizinische Ökologie VZ AR 322 2022 15 1215 384-390 7 |
| allfieldsSound |
10.1016/j.dam.2022.09.007 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001936.pica (DE-627)ELV059132264 (ELSEVIER)S0166-218X(22)00354-7 DE-627 ger DE-627 rakwb eng 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Matsumoto, Naoki verfasserin aut Graph grabbing game on totally-weighted graphs 2022transfer abstract 7 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier The graph grabbing game is a two-player game on a connected graph with a vertex-weight function. In the game, they alternately remove a non-cut vertex from the graph (i.e., the resulting graph remains connected) and get the weight assigned to the vertex. Each player’s aim is to maximize his or her outcome, when all vertices have been taken. In this paper, we consider the graph grabbing game on totally-weighted graphs that are graphs with weight functions from a set of elements in the vertex set and the edge set to non-negative real numbers. In this version, when a player removes a non-cut vertex v , that player gets the weight of v plus the total weight assigned to the edges incident to v . In particular, we give some results of interest for the graph grabbing game on edge-weighted trees, i.e., every vertex has weight zero. Moreover, we consider the game on edge-weighed graphs in the altered rule that each player must keep the connectedness of graphs induced by edges. The graph grabbing game is a two-player game on a connected graph with a vertex-weight function. In the game, they alternately remove a non-cut vertex from the graph (i.e., the resulting graph remains connected) and get the weight assigned to the vertex. Each player’s aim is to maximize his or her outcome, when all vertices have been taken. In this paper, we consider the graph grabbing game on totally-weighted graphs that are graphs with weight functions from a set of elements in the vertex set and the edge set to non-negative real numbers. In this version, when a player removes a non-cut vertex v , that player gets the weight of v plus the total weight assigned to the edges incident to v . In particular, we give some results of interest for the graph grabbing game on edge-weighted trees, i.e., every vertex has weight zero. Moreover, we consider the game on edge-weighed graphs in the altered rule that each player must keep the connectedness of graphs induced by edges. Edge-weighted graph Elsevier Totally-weighted graph Elsevier Graph grabbing game Elsevier Tree Elsevier Moriyama, Ryusei oth Ota, Katsuhiro oth Enthalten in Elsevier Miguel, F.L. ELSEVIER Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures 2013transfer abstract [S.l.] (DE-627)ELV011300345 volume:322 year:2022 day:15 month:12 pages:384-390 extent:7 https://doi.org/10.1016/j.dam.2022.09.007 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA SSG-OPC-GGO GBV_ILN_20 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_130 43.12 Umweltchemie VZ 43.13 Umwelttoxikologie VZ 44.13 Medizinische Ökologie VZ AR 322 2022 15 1215 384-390 7 |
| language |
English |
| source |
Enthalten in Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures [S.l.] volume:322 year:2022 day:15 month:12 pages:384-390 extent:7 |
| sourceStr |
Enthalten in Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures [S.l.] volume:322 year:2022 day:15 month:12 pages:384-390 extent:7 |
| format_phy_str_mv |
Article |
| bklname |
Umweltchemie Umwelttoxikologie Medizinische Ökologie |
| institution |
findex.gbv.de |
| topic_facet |
Edge-weighted graph Totally-weighted graph Graph grabbing game Tree |
| dewey-raw |
070 |
| isfreeaccess_bool |
false |
| container_title |
Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures |
| authorswithroles_txt_mv |
Matsumoto, Naoki @@aut@@ Moriyama, Ryusei @@oth@@ Ota, Katsuhiro @@oth@@ |
| publishDateDaySort_date |
2022-01-15T00:00:00Z |
| hierarchy_top_id |
ELV011300345 |
| dewey-sort |
270 |
| id |
ELV059132264 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV059132264</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230626052259.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">221103s2022 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.dam.2022.09.007</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">/cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001936.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV059132264</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0166-218X(22)00354-7</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">070</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">660</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">333.7</subfield><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">43.12</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">43.13</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">44.13</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Matsumoto, Naoki</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph grabbing game on totally-weighted graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">7</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The graph grabbing game is a two-player game on a connected graph with a vertex-weight function. In the game, they alternately remove a non-cut vertex from the graph (i.e., the resulting graph remains connected) and get the weight assigned to the vertex. Each player’s aim is to maximize his or her outcome, when all vertices have been taken. In this paper, we consider the graph grabbing game on totally-weighted graphs that are graphs with weight functions from a set of elements in the vertex set and the edge set to non-negative real numbers. In this version, when a player removes a non-cut vertex v , that player gets the weight of v plus the total weight assigned to the edges incident to v . In particular, we give some results of interest for the graph grabbing game on edge-weighted trees, i.e., every vertex has weight zero. Moreover, we consider the game on edge-weighed graphs in the altered rule that each player must keep the connectedness of graphs induced by edges.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The graph grabbing game is a two-player game on a connected graph with a vertex-weight function. In the game, they alternately remove a non-cut vertex from the graph (i.e., the resulting graph remains connected) and get the weight assigned to the vertex. Each player’s aim is to maximize his or her outcome, when all vertices have been taken. In this paper, we consider the graph grabbing game on totally-weighted graphs that are graphs with weight functions from a set of elements in the vertex set and the edge set to non-negative real numbers. In this version, when a player removes a non-cut vertex v , that player gets the weight of v plus the total weight assigned to the edges incident to v . In particular, we give some results of interest for the graph grabbing game on edge-weighted trees, i.e., every vertex has weight zero. Moreover, we consider the game on edge-weighed graphs in the altered rule that each player must keep the connectedness of graphs induced by edges.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Edge-weighted graph</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Totally-weighted graph</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graph grabbing game</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Tree</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Moriyama, Ryusei</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ota, Katsuhiro</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Miguel, F.L. ELSEVIER</subfield><subfield code="t">Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures</subfield><subfield code="d">2013transfer abstract</subfield><subfield code="g">[S.l.]</subfield><subfield code="w">(DE-627)ELV011300345</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:322</subfield><subfield code="g">year:2022</subfield><subfield code="g">day:15</subfield><subfield code="g">month:12</subfield><subfield code="g">pages:384-390</subfield><subfield code="g">extent:7</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.dam.2022.09.007</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-GGO</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">43.12</subfield><subfield code="j">Umweltchemie</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">43.13</subfield><subfield code="j">Umwelttoxikologie</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">44.13</subfield><subfield code="j">Medizinische Ökologie</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">322</subfield><subfield code="j">2022</subfield><subfield code="b">15</subfield><subfield code="c">1215</subfield><subfield code="h">384-390</subfield><subfield code="g">7</subfield></datafield></record></collection>
|
| author |
Matsumoto, Naoki |
| spellingShingle |
Matsumoto, Naoki ddc 070 ddc 660 ddc 333.7 bkl 43.12 bkl 43.13 bkl 44.13 Elsevier Edge-weighted graph Elsevier Totally-weighted graph Elsevier Graph grabbing game Elsevier Tree Graph grabbing game on totally-weighted graphs |
| authorStr |
Matsumoto, Naoki |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV011300345 |
| format |
electronic Article |
| dewey-ones |
070 - News media, journalism & publishing 660 - Chemical engineering 333 - Economics of land & energy 610 - Medicine & health |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
elsevier |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Graph grabbing game on totally-weighted graphs Edge-weighted graph Elsevier Totally-weighted graph Elsevier Graph grabbing game Elsevier Tree Elsevier |
| topic |
ddc 070 ddc 660 ddc 333.7 bkl 43.12 bkl 43.13 bkl 44.13 Elsevier Edge-weighted graph Elsevier Totally-weighted graph Elsevier Graph grabbing game Elsevier Tree |
| topic_unstemmed |
ddc 070 ddc 660 ddc 333.7 bkl 43.12 bkl 43.13 bkl 44.13 Elsevier Edge-weighted graph Elsevier Totally-weighted graph Elsevier Graph grabbing game Elsevier Tree |
| topic_browse |
ddc 070 ddc 660 ddc 333.7 bkl 43.12 bkl 43.13 bkl 44.13 Elsevier Edge-weighted graph Elsevier Totally-weighted graph Elsevier Graph grabbing game Elsevier Tree |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
r m rm k o ko |
| hierarchy_parent_title |
Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures |
| hierarchy_parent_id |
ELV011300345 |
| dewey-tens |
070 - News media, journalism & publishing 660 - Chemical engineering 330 - Economics 610 - Medicine & health |
| hierarchy_top_title |
Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)ELV011300345 |
| title |
Graph grabbing game on totally-weighted graphs |
| ctrlnum |
(DE-627)ELV059132264 (ELSEVIER)S0166-218X(22)00354-7 |
| title_full |
Graph grabbing game on totally-weighted graphs |
| author_sort |
Matsumoto, Naoki |
| journal |
Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures |
| journalStr |
Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 600 - Technology 300 - Social sciences |
| recordtype |
marc |
| publishDateSort |
2022 |
| contenttype_str_mv |
zzz |
| container_start_page |
384 |
| author_browse |
Matsumoto, Naoki |
| container_volume |
322 |
| physical |
7 |
| class |
070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl |
| format_se |
Elektronische Aufsätze |
| author-letter |
Matsumoto, Naoki |
| doi_str_mv |
10.1016/j.dam.2022.09.007 |
| dewey-full |
070 660 333.7 610 |
| title_sort |
graph grabbing game on totally-weighted graphs |
| title_auth |
Graph grabbing game on totally-weighted graphs |
| abstract |
The graph grabbing game is a two-player game on a connected graph with a vertex-weight function. In the game, they alternately remove a non-cut vertex from the graph (i.e., the resulting graph remains connected) and get the weight assigned to the vertex. Each player’s aim is to maximize his or her outcome, when all vertices have been taken. In this paper, we consider the graph grabbing game on totally-weighted graphs that are graphs with weight functions from a set of elements in the vertex set and the edge set to non-negative real numbers. In this version, when a player removes a non-cut vertex v , that player gets the weight of v plus the total weight assigned to the edges incident to v . In particular, we give some results of interest for the graph grabbing game on edge-weighted trees, i.e., every vertex has weight zero. Moreover, we consider the game on edge-weighed graphs in the altered rule that each player must keep the connectedness of graphs induced by edges. |
| abstractGer |
The graph grabbing game is a two-player game on a connected graph with a vertex-weight function. In the game, they alternately remove a non-cut vertex from the graph (i.e., the resulting graph remains connected) and get the weight assigned to the vertex. Each player’s aim is to maximize his or her outcome, when all vertices have been taken. In this paper, we consider the graph grabbing game on totally-weighted graphs that are graphs with weight functions from a set of elements in the vertex set and the edge set to non-negative real numbers. In this version, when a player removes a non-cut vertex v , that player gets the weight of v plus the total weight assigned to the edges incident to v . In particular, we give some results of interest for the graph grabbing game on edge-weighted trees, i.e., every vertex has weight zero. Moreover, we consider the game on edge-weighed graphs in the altered rule that each player must keep the connectedness of graphs induced by edges. |
| abstract_unstemmed |
The graph grabbing game is a two-player game on a connected graph with a vertex-weight function. In the game, they alternately remove a non-cut vertex from the graph (i.e., the resulting graph remains connected) and get the weight assigned to the vertex. Each player’s aim is to maximize his or her outcome, when all vertices have been taken. In this paper, we consider the graph grabbing game on totally-weighted graphs that are graphs with weight functions from a set of elements in the vertex set and the edge set to non-negative real numbers. In this version, when a player removes a non-cut vertex v , that player gets the weight of v plus the total weight assigned to the edges incident to v . In particular, we give some results of interest for the graph grabbing game on edge-weighted trees, i.e., every vertex has weight zero. Moreover, we consider the game on edge-weighed graphs in the altered rule that each player must keep the connectedness of graphs induced by edges. |
| collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U SSG-OLC-PHA SSG-OPC-GGO GBV_ILN_20 GBV_ILN_22 GBV_ILN_30 GBV_ILN_40 GBV_ILN_70 GBV_ILN_130 |
| title_short |
Graph grabbing game on totally-weighted graphs |
| url |
https://doi.org/10.1016/j.dam.2022.09.007 |
| remote_bool |
true |
| author2 |
Moriyama, Ryusei Ota, Katsuhiro |
| author2Str |
Moriyama, Ryusei Ota, Katsuhiro |
| ppnlink |
ELV011300345 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth |
| doi_str |
10.1016/j.dam.2022.09.007 |
| up_date |
2024-07-06T21:04:09.138Z |
| _version_ |
1803865134610776064 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV059132264</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230626052259.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">221103s2022 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.dam.2022.09.007</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">/cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001936.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV059132264</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0166-218X(22)00354-7</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">070</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">660</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">333.7</subfield><subfield code="a">610</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">43.12</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">43.13</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">44.13</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Matsumoto, Naoki</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph grabbing game on totally-weighted graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">7</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The graph grabbing game is a two-player game on a connected graph with a vertex-weight function. In the game, they alternately remove a non-cut vertex from the graph (i.e., the resulting graph remains connected) and get the weight assigned to the vertex. Each player’s aim is to maximize his or her outcome, when all vertices have been taken. In this paper, we consider the graph grabbing game on totally-weighted graphs that are graphs with weight functions from a set of elements in the vertex set and the edge set to non-negative real numbers. In this version, when a player removes a non-cut vertex v , that player gets the weight of v plus the total weight assigned to the edges incident to v . In particular, we give some results of interest for the graph grabbing game on edge-weighted trees, i.e., every vertex has weight zero. Moreover, we consider the game on edge-weighed graphs in the altered rule that each player must keep the connectedness of graphs induced by edges.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The graph grabbing game is a two-player game on a connected graph with a vertex-weight function. In the game, they alternately remove a non-cut vertex from the graph (i.e., the resulting graph remains connected) and get the weight assigned to the vertex. Each player’s aim is to maximize his or her outcome, when all vertices have been taken. In this paper, we consider the graph grabbing game on totally-weighted graphs that are graphs with weight functions from a set of elements in the vertex set and the edge set to non-negative real numbers. In this version, when a player removes a non-cut vertex v , that player gets the weight of v plus the total weight assigned to the edges incident to v . In particular, we give some results of interest for the graph grabbing game on edge-weighted trees, i.e., every vertex has weight zero. Moreover, we consider the game on edge-weighed graphs in the altered rule that each player must keep the connectedness of graphs induced by edges.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Edge-weighted graph</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Totally-weighted graph</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graph grabbing game</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Tree</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Moriyama, Ryusei</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ota, Katsuhiro</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="n">Elsevier</subfield><subfield code="a">Miguel, F.L. ELSEVIER</subfield><subfield code="t">Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures</subfield><subfield code="d">2013transfer abstract</subfield><subfield code="g">[S.l.]</subfield><subfield code="w">(DE-627)ELV011300345</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:322</subfield><subfield code="g">year:2022</subfield><subfield code="g">day:15</subfield><subfield code="g">month:12</subfield><subfield code="g">pages:384-390</subfield><subfield code="g">extent:7</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.dam.2022.09.007</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-PHA</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-GGO</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">43.12</subfield><subfield code="j">Umweltchemie</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">43.13</subfield><subfield code="j">Umwelttoxikologie</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">44.13</subfield><subfield code="j">Medizinische Ökologie</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">322</subfield><subfield code="j">2022</subfield><subfield code="b">15</subfield><subfield code="c">1215</subfield><subfield code="h">384-390</subfield><subfield code="g">7</subfield></datafield></record></collection>
|
| score |
7.3986425 |