Homothetic polygons and beyond: Maximal cliques in intersection graphs
We study the structure and the maximum number of maximal cliques in classes of intersection graphs of convex sets in the plane. It is known that convex-set intersection graphs, and also straight-line-segment intersection graphs may have exponentially many maximal cliques. On the other hand, in inter...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Brimkov, Valentin E. [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2018transfer abstract |
|---|
| Schlagwörter: |
|---|
| Umfang: |
15 |
|---|
| Ü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:247 ; year:2018 ; day:1 ; month:10 ; pages:263-277 ; extent:15 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.dam.2018.03.046 |
|---|
| Katalog-ID: |
ELV043761747 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV043761747 | ||
| 003 | DE-627 | ||
| 005 | 20230626004122.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 181113s2018 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.dam.2018.03.046 |2 doi | |
| 028 | 5 | 2 | |a /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001144.pica |
| 035 | |a (DE-627)ELV043761747 | ||
| 035 | |a (ELSEVIER)S0166-218X(18)30145-8 | ||
| 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 Brimkov, Valentin E. |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Homothetic polygons and beyond: Maximal cliques in intersection graphs |
| 264 | 1 | |c 2018transfer abstract | |
| 300 | |a 15 | ||
| 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 We study the structure and the maximum number of maximal cliques in classes of intersection graphs of convex sets in the plane. It is known that convex-set intersection graphs, and also straight-line-segment intersection graphs may have exponentially many maximal cliques. On the other hand, in intersection graphs of homothetic triangles, the maximum number of maximal cliques is polynomial in the number of vertices. We extend the latter result by showing that for every convex polygon P with sides parallel to k directions, every n -vertex graph which is an intersection graph of homothetic copies of P contains at most n k inclusion-wise maximal cliques. We actually prove this result for a more general class of graphs, the so-called k DIR - CONV , which are intersection graphs of convex polygons whose sides are parallel to some fixed k directions. Moreover, we provide lower bounds on the maximum number of maximal cliques and generalize the upper bound to intersection graphs of higher-dimensional convex polytopes in Euclidean space. Finally, we discuss the algorithmic consequences of the polynomial bound on the number of maximal cliques. | ||
| 520 | |a We study the structure and the maximum number of maximal cliques in classes of intersection graphs of convex sets in the plane. It is known that convex-set intersection graphs, and also straight-line-segment intersection graphs may have exponentially many maximal cliques. On the other hand, in intersection graphs of homothetic triangles, the maximum number of maximal cliques is polynomial in the number of vertices. We extend the latter result by showing that for every convex polygon P with sides parallel to k directions, every n -vertex graph which is an intersection graph of homothetic copies of P contains at most n k inclusion-wise maximal cliques. We actually prove this result for a more general class of graphs, the so-called k DIR - CONV , which are intersection graphs of convex polygons whose sides are parallel to some fixed k directions. Moreover, we provide lower bounds on the maximum number of maximal cliques and generalize the upper bound to intersection graphs of higher-dimensional convex polytopes in Euclidean space. Finally, we discuss the algorithmic consequences of the polynomial bound on the number of maximal cliques. | ||
| 650 | 7 | |a Maximal clique |2 Elsevier | |
| 650 | 7 | |a P h o m graphs |2 Elsevier | |
| 650 | 7 | |a Geometric intersection graphs |2 Elsevier | |
| 700 | 1 | |a Junosza-Szaniawski, Konstanty |4 oth | |
| 700 | 1 | |a Kafer, Sean |4 oth | |
| 700 | 1 | |a Kratochvíl, Jan |4 oth | |
| 700 | 1 | |a Pergel, Martin |4 oth | |
| 700 | 1 | |a Rzążewski, Paweł |4 oth | |
| 700 | 1 | |a Szczepankiewicz, Matthew |4 oth | |
| 700 | 1 | |a Terhaar, Joshua |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:247 |g year:2018 |g day:1 |g month:10 |g pages:263-277 |g extent:15 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.dam.2018.03.046 |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 247 |j 2018 |b 1 |c 1001 |h 263-277 |g 15 | ||
| author_variant |
v e b ve veb |
|---|---|
| matchkey_str |
brimkovvalentinejunoszaszaniawskikonstan:2018----:oohtcoyosnbynmxmllqeii |
| hierarchy_sort_str |
2018transfer abstract |
| bklnumber |
43.12 43.13 44.13 |
| publishDate |
2018 |
| allfields |
10.1016/j.dam.2018.03.046 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001144.pica (DE-627)ELV043761747 (ELSEVIER)S0166-218X(18)30145-8 DE-627 ger DE-627 rakwb eng 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Brimkov, Valentin E. verfasserin aut Homothetic polygons and beyond: Maximal cliques in intersection graphs 2018transfer abstract 15 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier We study the structure and the maximum number of maximal cliques in classes of intersection graphs of convex sets in the plane. It is known that convex-set intersection graphs, and also straight-line-segment intersection graphs may have exponentially many maximal cliques. On the other hand, in intersection graphs of homothetic triangles, the maximum number of maximal cliques is polynomial in the number of vertices. We extend the latter result by showing that for every convex polygon P with sides parallel to k directions, every n -vertex graph which is an intersection graph of homothetic copies of P contains at most n k inclusion-wise maximal cliques. We actually prove this result for a more general class of graphs, the so-called k DIR - CONV , which are intersection graphs of convex polygons whose sides are parallel to some fixed k directions. Moreover, we provide lower bounds on the maximum number of maximal cliques and generalize the upper bound to intersection graphs of higher-dimensional convex polytopes in Euclidean space. Finally, we discuss the algorithmic consequences of the polynomial bound on the number of maximal cliques. We study the structure and the maximum number of maximal cliques in classes of intersection graphs of convex sets in the plane. It is known that convex-set intersection graphs, and also straight-line-segment intersection graphs may have exponentially many maximal cliques. On the other hand, in intersection graphs of homothetic triangles, the maximum number of maximal cliques is polynomial in the number of vertices. We extend the latter result by showing that for every convex polygon P with sides parallel to k directions, every n -vertex graph which is an intersection graph of homothetic copies of P contains at most n k inclusion-wise maximal cliques. We actually prove this result for a more general class of graphs, the so-called k DIR - CONV , which are intersection graphs of convex polygons whose sides are parallel to some fixed k directions. Moreover, we provide lower bounds on the maximum number of maximal cliques and generalize the upper bound to intersection graphs of higher-dimensional convex polytopes in Euclidean space. Finally, we discuss the algorithmic consequences of the polynomial bound on the number of maximal cliques. Maximal clique Elsevier P h o m graphs Elsevier Geometric intersection graphs Elsevier Junosza-Szaniawski, Konstanty oth Kafer, Sean oth Kratochvíl, Jan oth Pergel, Martin oth Rzążewski, Paweł oth Szczepankiewicz, Matthew oth Terhaar, Joshua 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:247 year:2018 day:1 month:10 pages:263-277 extent:15 https://doi.org/10.1016/j.dam.2018.03.046 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 247 2018 1 1001 263-277 15 |
| spelling |
10.1016/j.dam.2018.03.046 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001144.pica (DE-627)ELV043761747 (ELSEVIER)S0166-218X(18)30145-8 DE-627 ger DE-627 rakwb eng 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Brimkov, Valentin E. verfasserin aut Homothetic polygons and beyond: Maximal cliques in intersection graphs 2018transfer abstract 15 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier We study the structure and the maximum number of maximal cliques in classes of intersection graphs of convex sets in the plane. It is known that convex-set intersection graphs, and also straight-line-segment intersection graphs may have exponentially many maximal cliques. On the other hand, in intersection graphs of homothetic triangles, the maximum number of maximal cliques is polynomial in the number of vertices. We extend the latter result by showing that for every convex polygon P with sides parallel to k directions, every n -vertex graph which is an intersection graph of homothetic copies of P contains at most n k inclusion-wise maximal cliques. We actually prove this result for a more general class of graphs, the so-called k DIR - CONV , which are intersection graphs of convex polygons whose sides are parallel to some fixed k directions. Moreover, we provide lower bounds on the maximum number of maximal cliques and generalize the upper bound to intersection graphs of higher-dimensional convex polytopes in Euclidean space. Finally, we discuss the algorithmic consequences of the polynomial bound on the number of maximal cliques. We study the structure and the maximum number of maximal cliques in classes of intersection graphs of convex sets in the plane. It is known that convex-set intersection graphs, and also straight-line-segment intersection graphs may have exponentially many maximal cliques. On the other hand, in intersection graphs of homothetic triangles, the maximum number of maximal cliques is polynomial in the number of vertices. We extend the latter result by showing that for every convex polygon P with sides parallel to k directions, every n -vertex graph which is an intersection graph of homothetic copies of P contains at most n k inclusion-wise maximal cliques. We actually prove this result for a more general class of graphs, the so-called k DIR - CONV , which are intersection graphs of convex polygons whose sides are parallel to some fixed k directions. Moreover, we provide lower bounds on the maximum number of maximal cliques and generalize the upper bound to intersection graphs of higher-dimensional convex polytopes in Euclidean space. Finally, we discuss the algorithmic consequences of the polynomial bound on the number of maximal cliques. Maximal clique Elsevier P h o m graphs Elsevier Geometric intersection graphs Elsevier Junosza-Szaniawski, Konstanty oth Kafer, Sean oth Kratochvíl, Jan oth Pergel, Martin oth Rzążewski, Paweł oth Szczepankiewicz, Matthew oth Terhaar, Joshua 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:247 year:2018 day:1 month:10 pages:263-277 extent:15 https://doi.org/10.1016/j.dam.2018.03.046 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 247 2018 1 1001 263-277 15 |
| allfields_unstemmed |
10.1016/j.dam.2018.03.046 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001144.pica (DE-627)ELV043761747 (ELSEVIER)S0166-218X(18)30145-8 DE-627 ger DE-627 rakwb eng 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Brimkov, Valentin E. verfasserin aut Homothetic polygons and beyond: Maximal cliques in intersection graphs 2018transfer abstract 15 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier We study the structure and the maximum number of maximal cliques in classes of intersection graphs of convex sets in the plane. It is known that convex-set intersection graphs, and also straight-line-segment intersection graphs may have exponentially many maximal cliques. On the other hand, in intersection graphs of homothetic triangles, the maximum number of maximal cliques is polynomial in the number of vertices. We extend the latter result by showing that for every convex polygon P with sides parallel to k directions, every n -vertex graph which is an intersection graph of homothetic copies of P contains at most n k inclusion-wise maximal cliques. We actually prove this result for a more general class of graphs, the so-called k DIR - CONV , which are intersection graphs of convex polygons whose sides are parallel to some fixed k directions. Moreover, we provide lower bounds on the maximum number of maximal cliques and generalize the upper bound to intersection graphs of higher-dimensional convex polytopes in Euclidean space. Finally, we discuss the algorithmic consequences of the polynomial bound on the number of maximal cliques. We study the structure and the maximum number of maximal cliques in classes of intersection graphs of convex sets in the plane. It is known that convex-set intersection graphs, and also straight-line-segment intersection graphs may have exponentially many maximal cliques. On the other hand, in intersection graphs of homothetic triangles, the maximum number of maximal cliques is polynomial in the number of vertices. We extend the latter result by showing that for every convex polygon P with sides parallel to k directions, every n -vertex graph which is an intersection graph of homothetic copies of P contains at most n k inclusion-wise maximal cliques. We actually prove this result for a more general class of graphs, the so-called k DIR - CONV , which are intersection graphs of convex polygons whose sides are parallel to some fixed k directions. Moreover, we provide lower bounds on the maximum number of maximal cliques and generalize the upper bound to intersection graphs of higher-dimensional convex polytopes in Euclidean space. Finally, we discuss the algorithmic consequences of the polynomial bound on the number of maximal cliques. Maximal clique Elsevier P h o m graphs Elsevier Geometric intersection graphs Elsevier Junosza-Szaniawski, Konstanty oth Kafer, Sean oth Kratochvíl, Jan oth Pergel, Martin oth Rzążewski, Paweł oth Szczepankiewicz, Matthew oth Terhaar, Joshua 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:247 year:2018 day:1 month:10 pages:263-277 extent:15 https://doi.org/10.1016/j.dam.2018.03.046 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 247 2018 1 1001 263-277 15 |
| allfieldsGer |
10.1016/j.dam.2018.03.046 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001144.pica (DE-627)ELV043761747 (ELSEVIER)S0166-218X(18)30145-8 DE-627 ger DE-627 rakwb eng 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Brimkov, Valentin E. verfasserin aut Homothetic polygons and beyond: Maximal cliques in intersection graphs 2018transfer abstract 15 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier We study the structure and the maximum number of maximal cliques in classes of intersection graphs of convex sets in the plane. It is known that convex-set intersection graphs, and also straight-line-segment intersection graphs may have exponentially many maximal cliques. On the other hand, in intersection graphs of homothetic triangles, the maximum number of maximal cliques is polynomial in the number of vertices. We extend the latter result by showing that for every convex polygon P with sides parallel to k directions, every n -vertex graph which is an intersection graph of homothetic copies of P contains at most n k inclusion-wise maximal cliques. We actually prove this result for a more general class of graphs, the so-called k DIR - CONV , which are intersection graphs of convex polygons whose sides are parallel to some fixed k directions. Moreover, we provide lower bounds on the maximum number of maximal cliques and generalize the upper bound to intersection graphs of higher-dimensional convex polytopes in Euclidean space. Finally, we discuss the algorithmic consequences of the polynomial bound on the number of maximal cliques. We study the structure and the maximum number of maximal cliques in classes of intersection graphs of convex sets in the plane. It is known that convex-set intersection graphs, and also straight-line-segment intersection graphs may have exponentially many maximal cliques. On the other hand, in intersection graphs of homothetic triangles, the maximum number of maximal cliques is polynomial in the number of vertices. We extend the latter result by showing that for every convex polygon P with sides parallel to k directions, every n -vertex graph which is an intersection graph of homothetic copies of P contains at most n k inclusion-wise maximal cliques. We actually prove this result for a more general class of graphs, the so-called k DIR - CONV , which are intersection graphs of convex polygons whose sides are parallel to some fixed k directions. Moreover, we provide lower bounds on the maximum number of maximal cliques and generalize the upper bound to intersection graphs of higher-dimensional convex polytopes in Euclidean space. Finally, we discuss the algorithmic consequences of the polynomial bound on the number of maximal cliques. Maximal clique Elsevier P h o m graphs Elsevier Geometric intersection graphs Elsevier Junosza-Szaniawski, Konstanty oth Kafer, Sean oth Kratochvíl, Jan oth Pergel, Martin oth Rzążewski, Paweł oth Szczepankiewicz, Matthew oth Terhaar, Joshua 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:247 year:2018 day:1 month:10 pages:263-277 extent:15 https://doi.org/10.1016/j.dam.2018.03.046 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 247 2018 1 1001 263-277 15 |
| allfieldsSound |
10.1016/j.dam.2018.03.046 doi /cbs_pica/cbs_olc/import_discovery/elsevier/einzuspielen/GBV00000000001144.pica (DE-627)ELV043761747 (ELSEVIER)S0166-218X(18)30145-8 DE-627 ger DE-627 rakwb eng 070 VZ 660 VZ 333.7 610 VZ 43.12 bkl 43.13 bkl 44.13 bkl Brimkov, Valentin E. verfasserin aut Homothetic polygons and beyond: Maximal cliques in intersection graphs 2018transfer abstract 15 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier We study the structure and the maximum number of maximal cliques in classes of intersection graphs of convex sets in the plane. It is known that convex-set intersection graphs, and also straight-line-segment intersection graphs may have exponentially many maximal cliques. On the other hand, in intersection graphs of homothetic triangles, the maximum number of maximal cliques is polynomial in the number of vertices. We extend the latter result by showing that for every convex polygon P with sides parallel to k directions, every n -vertex graph which is an intersection graph of homothetic copies of P contains at most n k inclusion-wise maximal cliques. We actually prove this result for a more general class of graphs, the so-called k DIR - CONV , which are intersection graphs of convex polygons whose sides are parallel to some fixed k directions. Moreover, we provide lower bounds on the maximum number of maximal cliques and generalize the upper bound to intersection graphs of higher-dimensional convex polytopes in Euclidean space. Finally, we discuss the algorithmic consequences of the polynomial bound on the number of maximal cliques. We study the structure and the maximum number of maximal cliques in classes of intersection graphs of convex sets in the plane. It is known that convex-set intersection graphs, and also straight-line-segment intersection graphs may have exponentially many maximal cliques. On the other hand, in intersection graphs of homothetic triangles, the maximum number of maximal cliques is polynomial in the number of vertices. We extend the latter result by showing that for every convex polygon P with sides parallel to k directions, every n -vertex graph which is an intersection graph of homothetic copies of P contains at most n k inclusion-wise maximal cliques. We actually prove this result for a more general class of graphs, the so-called k DIR - CONV , which are intersection graphs of convex polygons whose sides are parallel to some fixed k directions. Moreover, we provide lower bounds on the maximum number of maximal cliques and generalize the upper bound to intersection graphs of higher-dimensional convex polytopes in Euclidean space. Finally, we discuss the algorithmic consequences of the polynomial bound on the number of maximal cliques. Maximal clique Elsevier P h o m graphs Elsevier Geometric intersection graphs Elsevier Junosza-Szaniawski, Konstanty oth Kafer, Sean oth Kratochvíl, Jan oth Pergel, Martin oth Rzążewski, Paweł oth Szczepankiewicz, Matthew oth Terhaar, Joshua 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:247 year:2018 day:1 month:10 pages:263-277 extent:15 https://doi.org/10.1016/j.dam.2018.03.046 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 247 2018 1 1001 263-277 15 |
| language |
English |
| source |
Enthalten in Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures [S.l.] volume:247 year:2018 day:1 month:10 pages:263-277 extent:15 |
| sourceStr |
Enthalten in Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures [S.l.] volume:247 year:2018 day:1 month:10 pages:263-277 extent:15 |
| format_phy_str_mv |
Article |
| bklname |
Umweltchemie Umwelttoxikologie Medizinische Ökologie |
| institution |
findex.gbv.de |
| topic_facet |
Maximal clique P h o m graphs Geometric intersection graphs |
| dewey-raw |
070 |
| isfreeaccess_bool |
false |
| container_title |
Electroless deposition of a Ag matrix on semiconducting one-dimensional nanostructures |
| authorswithroles_txt_mv |
Brimkov, Valentin E. @@aut@@ Junosza-Szaniawski, Konstanty @@oth@@ Kafer, Sean @@oth@@ Kratochvíl, Jan @@oth@@ Pergel, Martin @@oth@@ Rzążewski, Paweł @@oth@@ Szczepankiewicz, Matthew @@oth@@ Terhaar, Joshua @@oth@@ |
| publishDateDaySort_date |
2018-01-01T00:00:00Z |
| hierarchy_top_id |
ELV011300345 |
| dewey-sort |
270 |
| id |
ELV043761747 |
| 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">ELV043761747</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230626004122.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">181113s2018 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.dam.2018.03.046</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/GBV00000000001144.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV043761747</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0166-218X(18)30145-8</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">Brimkov, Valentin E.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Homothetic polygons and beyond: Maximal cliques in intersection graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">15</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">We study the structure and the maximum number of maximal cliques in classes of intersection graphs of convex sets in the plane. It is known that convex-set intersection graphs, and also straight-line-segment intersection graphs may have exponentially many maximal cliques. On the other hand, in intersection graphs of homothetic triangles, the maximum number of maximal cliques is polynomial in the number of vertices. We extend the latter result by showing that for every convex polygon P with sides parallel to k directions, every n -vertex graph which is an intersection graph of homothetic copies of P contains at most n k inclusion-wise maximal cliques. We actually prove this result for a more general class of graphs, the so-called k DIR - CONV , which are intersection graphs of convex polygons whose sides are parallel to some fixed k directions. Moreover, we provide lower bounds on the maximum number of maximal cliques and generalize the upper bound to intersection graphs of higher-dimensional convex polytopes in Euclidean space. Finally, we discuss the algorithmic consequences of the polynomial bound on the number of maximal cliques.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We study the structure and the maximum number of maximal cliques in classes of intersection graphs of convex sets in the plane. It is known that convex-set intersection graphs, and also straight-line-segment intersection graphs may have exponentially many maximal cliques. On the other hand, in intersection graphs of homothetic triangles, the maximum number of maximal cliques is polynomial in the number of vertices. We extend the latter result by showing that for every convex polygon P with sides parallel to k directions, every n -vertex graph which is an intersection graph of homothetic copies of P contains at most n k inclusion-wise maximal cliques. We actually prove this result for a more general class of graphs, the so-called k DIR - CONV , which are intersection graphs of convex polygons whose sides are parallel to some fixed k directions. Moreover, we provide lower bounds on the maximum number of maximal cliques and generalize the upper bound to intersection graphs of higher-dimensional convex polytopes in Euclidean space. Finally, we discuss the algorithmic consequences of the polynomial bound on the number of maximal cliques.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Maximal clique</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">P h o m graphs</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Geometric intersection graphs</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Junosza-Szaniawski, Konstanty</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kafer, Sean</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kratochvíl, Jan</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pergel, Martin</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rzążewski, Paweł</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Szczepankiewicz, Matthew</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Terhaar, Joshua</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:247</subfield><subfield code="g">year:2018</subfield><subfield code="g">day:1</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:263-277</subfield><subfield code="g">extent:15</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.dam.2018.03.046</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">247</subfield><subfield code="j">2018</subfield><subfield code="b">1</subfield><subfield code="c">1001</subfield><subfield code="h">263-277</subfield><subfield code="g">15</subfield></datafield></record></collection>
|
| author |
Brimkov, Valentin E. |
| spellingShingle |
Brimkov, Valentin E. ddc 070 ddc 660 ddc 333.7 bkl 43.12 bkl 43.13 bkl 44.13 Elsevier Maximal clique Elsevier P h o m graphs Elsevier Geometric intersection graphs Homothetic polygons and beyond: Maximal cliques in intersection graphs |
| authorStr |
Brimkov, Valentin E. |
| 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 Homothetic polygons and beyond: Maximal cliques in intersection graphs Maximal clique Elsevier P h o m graphs Elsevier Geometric intersection graphs Elsevier |
| topic |
ddc 070 ddc 660 ddc 333.7 bkl 43.12 bkl 43.13 bkl 44.13 Elsevier Maximal clique Elsevier P h o m graphs Elsevier Geometric intersection graphs |
| topic_unstemmed |
ddc 070 ddc 660 ddc 333.7 bkl 43.12 bkl 43.13 bkl 44.13 Elsevier Maximal clique Elsevier P h o m graphs Elsevier Geometric intersection graphs |
| topic_browse |
ddc 070 ddc 660 ddc 333.7 bkl 43.12 bkl 43.13 bkl 44.13 Elsevier Maximal clique Elsevier P h o m graphs Elsevier Geometric intersection graphs |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
k j s kjs s k sk j k jk m p mp p r pr m s ms j t jt |
| 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 |
Homothetic polygons and beyond: Maximal cliques in intersection graphs |
| ctrlnum |
(DE-627)ELV043761747 (ELSEVIER)S0166-218X(18)30145-8 |
| title_full |
Homothetic polygons and beyond: Maximal cliques in intersection graphs |
| author_sort |
Brimkov, Valentin E. |
| 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 |
2018 |
| contenttype_str_mv |
zzz |
| container_start_page |
263 |
| author_browse |
Brimkov, Valentin E. |
| container_volume |
247 |
| physical |
15 |
| 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 |
Brimkov, Valentin E. |
| doi_str_mv |
10.1016/j.dam.2018.03.046 |
| dewey-full |
070 660 333.7 610 |
| title_sort |
homothetic polygons and beyond: maximal cliques in intersection graphs |
| title_auth |
Homothetic polygons and beyond: Maximal cliques in intersection graphs |
| abstract |
We study the structure and the maximum number of maximal cliques in classes of intersection graphs of convex sets in the plane. It is known that convex-set intersection graphs, and also straight-line-segment intersection graphs may have exponentially many maximal cliques. On the other hand, in intersection graphs of homothetic triangles, the maximum number of maximal cliques is polynomial in the number of vertices. We extend the latter result by showing that for every convex polygon P with sides parallel to k directions, every n -vertex graph which is an intersection graph of homothetic copies of P contains at most n k inclusion-wise maximal cliques. We actually prove this result for a more general class of graphs, the so-called k DIR - CONV , which are intersection graphs of convex polygons whose sides are parallel to some fixed k directions. Moreover, we provide lower bounds on the maximum number of maximal cliques and generalize the upper bound to intersection graphs of higher-dimensional convex polytopes in Euclidean space. Finally, we discuss the algorithmic consequences of the polynomial bound on the number of maximal cliques. |
| abstractGer |
We study the structure and the maximum number of maximal cliques in classes of intersection graphs of convex sets in the plane. It is known that convex-set intersection graphs, and also straight-line-segment intersection graphs may have exponentially many maximal cliques. On the other hand, in intersection graphs of homothetic triangles, the maximum number of maximal cliques is polynomial in the number of vertices. We extend the latter result by showing that for every convex polygon P with sides parallel to k directions, every n -vertex graph which is an intersection graph of homothetic copies of P contains at most n k inclusion-wise maximal cliques. We actually prove this result for a more general class of graphs, the so-called k DIR - CONV , which are intersection graphs of convex polygons whose sides are parallel to some fixed k directions. Moreover, we provide lower bounds on the maximum number of maximal cliques and generalize the upper bound to intersection graphs of higher-dimensional convex polytopes in Euclidean space. Finally, we discuss the algorithmic consequences of the polynomial bound on the number of maximal cliques. |
| abstract_unstemmed |
We study the structure and the maximum number of maximal cliques in classes of intersection graphs of convex sets in the plane. It is known that convex-set intersection graphs, and also straight-line-segment intersection graphs may have exponentially many maximal cliques. On the other hand, in intersection graphs of homothetic triangles, the maximum number of maximal cliques is polynomial in the number of vertices. We extend the latter result by showing that for every convex polygon P with sides parallel to k directions, every n -vertex graph which is an intersection graph of homothetic copies of P contains at most n k inclusion-wise maximal cliques. We actually prove this result for a more general class of graphs, the so-called k DIR - CONV , which are intersection graphs of convex polygons whose sides are parallel to some fixed k directions. Moreover, we provide lower bounds on the maximum number of maximal cliques and generalize the upper bound to intersection graphs of higher-dimensional convex polytopes in Euclidean space. Finally, we discuss the algorithmic consequences of the polynomial bound on the number of maximal cliques. |
| 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 |
Homothetic polygons and beyond: Maximal cliques in intersection graphs |
| url |
https://doi.org/10.1016/j.dam.2018.03.046 |
| remote_bool |
true |
| author2 |
Junosza-Szaniawski, Konstanty Kafer, Sean Kratochvíl, Jan Pergel, Martin Rzążewski, Paweł Szczepankiewicz, Matthew Terhaar, Joshua |
| author2Str |
Junosza-Szaniawski, Konstanty Kafer, Sean Kratochvíl, Jan Pergel, Martin Rzążewski, Paweł Szczepankiewicz, Matthew Terhaar, Joshua |
| ppnlink |
ELV011300345 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth oth oth oth oth oth |
| doi_str |
10.1016/j.dam.2018.03.046 |
| up_date |
2024-07-06T19:41:11.783Z |
| _version_ |
1803859915474731008 |
| 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">ELV043761747</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230626004122.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">181113s2018 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.dam.2018.03.046</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/GBV00000000001144.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV043761747</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0166-218X(18)30145-8</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">Brimkov, Valentin E.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Homothetic polygons and beyond: Maximal cliques in intersection graphs</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">15</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">We study the structure and the maximum number of maximal cliques in classes of intersection graphs of convex sets in the plane. It is known that convex-set intersection graphs, and also straight-line-segment intersection graphs may have exponentially many maximal cliques. On the other hand, in intersection graphs of homothetic triangles, the maximum number of maximal cliques is polynomial in the number of vertices. We extend the latter result by showing that for every convex polygon P with sides parallel to k directions, every n -vertex graph which is an intersection graph of homothetic copies of P contains at most n k inclusion-wise maximal cliques. We actually prove this result for a more general class of graphs, the so-called k DIR - CONV , which are intersection graphs of convex polygons whose sides are parallel to some fixed k directions. Moreover, we provide lower bounds on the maximum number of maximal cliques and generalize the upper bound to intersection graphs of higher-dimensional convex polytopes in Euclidean space. Finally, we discuss the algorithmic consequences of the polynomial bound on the number of maximal cliques.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We study the structure and the maximum number of maximal cliques in classes of intersection graphs of convex sets in the plane. It is known that convex-set intersection graphs, and also straight-line-segment intersection graphs may have exponentially many maximal cliques. On the other hand, in intersection graphs of homothetic triangles, the maximum number of maximal cliques is polynomial in the number of vertices. We extend the latter result by showing that for every convex polygon P with sides parallel to k directions, every n -vertex graph which is an intersection graph of homothetic copies of P contains at most n k inclusion-wise maximal cliques. We actually prove this result for a more general class of graphs, the so-called k DIR - CONV , which are intersection graphs of convex polygons whose sides are parallel to some fixed k directions. Moreover, we provide lower bounds on the maximum number of maximal cliques and generalize the upper bound to intersection graphs of higher-dimensional convex polytopes in Euclidean space. Finally, we discuss the algorithmic consequences of the polynomial bound on the number of maximal cliques.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Maximal clique</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">P h o m graphs</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Geometric intersection graphs</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Junosza-Szaniawski, Konstanty</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kafer, Sean</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kratochvíl, Jan</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pergel, Martin</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Rzążewski, Paweł</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Szczepankiewicz, Matthew</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Terhaar, Joshua</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:247</subfield><subfield code="g">year:2018</subfield><subfield code="g">day:1</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:263-277</subfield><subfield code="g">extent:15</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.dam.2018.03.046</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">247</subfield><subfield code="j">2018</subfield><subfield code="b">1</subfield><subfield code="c">1001</subfield><subfield code="h">263-277</subfield><subfield code="g">15</subfield></datafield></record></collection>
|
| score |
7.4032135 |