Greedy rectilinear drawings
A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. From an application perspective, greedy drawings are especially relevant to support routing schemes in a...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Angelini, Patrizio [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2019transfer abstract |
|---|
| Schlagwörter: |
|---|
| Umfang: |
23 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries - Schweiss, Rüdiger ELSEVIER, 2015transfer abstract, the journal of the EATCS, Amsterdam [u.a.] |
|---|---|
| Übergeordnetes Werk: |
volume:795 ; year:2019 ; day:26 ; month:11 ; pages:375-397 ; extent:23 |
| Links: |
|---|
| DOI / URN: |
10.1016/j.tcs.2019.07.019 |
|---|
| Katalog-ID: |
ELV048143944 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | ELV048143944 | ||
| 003 | DE-627 | ||
| 005 | 20230626021255.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 191023s2019 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1016/j.tcs.2019.07.019 |2 doi | |
| 028 | 5 | 2 | |a GBV00000000000776.pica |
| 035 | |a (DE-627)ELV048143944 | ||
| 035 | |a (ELSEVIER)S0304-3975(19)30454-2 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 620 |q VZ |
| 082 | 0 | 4 | |a 690 |q VZ |
| 084 | |a 50.92 |2 bkl | ||
| 100 | 1 | |a Angelini, Patrizio |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Greedy rectilinear drawings |
| 264 | 1 | |c 2019transfer abstract | |
| 300 | |a 23 | ||
| 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 A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. From an application perspective, greedy drawings are especially relevant to support routing schemes in ad hoc wireless networks. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing succinctness. We introduce greedy rectilinear drawings, where edges are horizontal or vertical segments. These drawings have several properties that improve human readability and support network routing. | ||
| 520 | |a A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. From an application perspective, greedy drawings are especially relevant to support routing schemes in ad hoc wireless networks. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing succinctness. We introduce greedy rectilinear drawings, where edges are horizontal or vertical segments. These drawings have several properties that improve human readability and support network routing. | ||
| 650 | 7 | |a Graph Drawing |2 Elsevier | |
| 650 | 7 | |a Greedy drawings |2 Elsevier | |
| 650 | 7 | |a Orthogonal drawings |2 Elsevier | |
| 700 | 1 | |a Bekos, Michael A. |4 oth | |
| 700 | 1 | |a Didimo, Walter |4 oth | |
| 700 | 1 | |a Grilli, Luca |4 oth | |
| 700 | 1 | |a Kindermann, Philipp |4 oth | |
| 700 | 1 | |a Mchedlidze, Tamara |4 oth | |
| 700 | 1 | |a Prutkin, Roman |4 oth | |
| 700 | 1 | |a Symvonis, Antonios |4 oth | |
| 700 | 1 | |a Tappini, Alessandra |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |n Elsevier |a Schweiss, Rüdiger ELSEVIER |t Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |d 2015transfer abstract |d the journal of the EATCS |g Amsterdam [u.a.] |w (DE-627)ELV013125583 |
| 773 | 1 | 8 | |g volume:795 |g year:2019 |g day:26 |g month:11 |g pages:375-397 |g extent:23 |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.tcs.2019.07.019 |3 Volltext |
| 912 | |a GBV_USEFLAG_U | ||
| 912 | |a GBV_ELV | ||
| 912 | |a SYSFLAG_U | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_40 | ||
| 936 | b | k | |a 50.92 |j Meerestechnik |q VZ |
| 951 | |a AR | ||
| 952 | |d 795 |j 2019 |b 26 |c 1126 |h 375-397 |g 23 | ||
| author_variant |
p a pa |
|---|---|
| matchkey_str |
angelinipatriziobekosmichaeladidimowalte:2019----:reyetlnad |
| hierarchy_sort_str |
2019transfer abstract |
| bklnumber |
50.92 |
| publishDate |
2019 |
| allfields |
10.1016/j.tcs.2019.07.019 doi GBV00000000000776.pica (DE-627)ELV048143944 (ELSEVIER)S0304-3975(19)30454-2 DE-627 ger DE-627 rakwb eng 620 VZ 690 VZ 50.92 bkl Angelini, Patrizio verfasserin aut Greedy rectilinear drawings 2019transfer abstract 23 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. From an application perspective, greedy drawings are especially relevant to support routing schemes in ad hoc wireless networks. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing succinctness. We introduce greedy rectilinear drawings, where edges are horizontal or vertical segments. These drawings have several properties that improve human readability and support network routing. A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. From an application perspective, greedy drawings are especially relevant to support routing schemes in ad hoc wireless networks. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing succinctness. We introduce greedy rectilinear drawings, where edges are horizontal or vertical segments. These drawings have several properties that improve human readability and support network routing. Graph Drawing Elsevier Greedy drawings Elsevier Orthogonal drawings Elsevier Bekos, Michael A. oth Didimo, Walter oth Grilli, Luca oth Kindermann, Philipp oth Mchedlidze, Tamara oth Prutkin, Roman oth Symvonis, Antonios oth Tappini, Alessandra oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:795 year:2019 day:26 month:11 pages:375-397 extent:23 https://doi.org/10.1016/j.tcs.2019.07.019 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 795 2019 26 1126 375-397 23 |
| spelling |
10.1016/j.tcs.2019.07.019 doi GBV00000000000776.pica (DE-627)ELV048143944 (ELSEVIER)S0304-3975(19)30454-2 DE-627 ger DE-627 rakwb eng 620 VZ 690 VZ 50.92 bkl Angelini, Patrizio verfasserin aut Greedy rectilinear drawings 2019transfer abstract 23 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. From an application perspective, greedy drawings are especially relevant to support routing schemes in ad hoc wireless networks. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing succinctness. We introduce greedy rectilinear drawings, where edges are horizontal or vertical segments. These drawings have several properties that improve human readability and support network routing. A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. From an application perspective, greedy drawings are especially relevant to support routing schemes in ad hoc wireless networks. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing succinctness. We introduce greedy rectilinear drawings, where edges are horizontal or vertical segments. These drawings have several properties that improve human readability and support network routing. Graph Drawing Elsevier Greedy drawings Elsevier Orthogonal drawings Elsevier Bekos, Michael A. oth Didimo, Walter oth Grilli, Luca oth Kindermann, Philipp oth Mchedlidze, Tamara oth Prutkin, Roman oth Symvonis, Antonios oth Tappini, Alessandra oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:795 year:2019 day:26 month:11 pages:375-397 extent:23 https://doi.org/10.1016/j.tcs.2019.07.019 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 795 2019 26 1126 375-397 23 |
| allfields_unstemmed |
10.1016/j.tcs.2019.07.019 doi GBV00000000000776.pica (DE-627)ELV048143944 (ELSEVIER)S0304-3975(19)30454-2 DE-627 ger DE-627 rakwb eng 620 VZ 690 VZ 50.92 bkl Angelini, Patrizio verfasserin aut Greedy rectilinear drawings 2019transfer abstract 23 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. From an application perspective, greedy drawings are especially relevant to support routing schemes in ad hoc wireless networks. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing succinctness. We introduce greedy rectilinear drawings, where edges are horizontal or vertical segments. These drawings have several properties that improve human readability and support network routing. A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. From an application perspective, greedy drawings are especially relevant to support routing schemes in ad hoc wireless networks. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing succinctness. We introduce greedy rectilinear drawings, where edges are horizontal or vertical segments. These drawings have several properties that improve human readability and support network routing. Graph Drawing Elsevier Greedy drawings Elsevier Orthogonal drawings Elsevier Bekos, Michael A. oth Didimo, Walter oth Grilli, Luca oth Kindermann, Philipp oth Mchedlidze, Tamara oth Prutkin, Roman oth Symvonis, Antonios oth Tappini, Alessandra oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:795 year:2019 day:26 month:11 pages:375-397 extent:23 https://doi.org/10.1016/j.tcs.2019.07.019 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 795 2019 26 1126 375-397 23 |
| allfieldsGer |
10.1016/j.tcs.2019.07.019 doi GBV00000000000776.pica (DE-627)ELV048143944 (ELSEVIER)S0304-3975(19)30454-2 DE-627 ger DE-627 rakwb eng 620 VZ 690 VZ 50.92 bkl Angelini, Patrizio verfasserin aut Greedy rectilinear drawings 2019transfer abstract 23 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. From an application perspective, greedy drawings are especially relevant to support routing schemes in ad hoc wireless networks. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing succinctness. We introduce greedy rectilinear drawings, where edges are horizontal or vertical segments. These drawings have several properties that improve human readability and support network routing. A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. From an application perspective, greedy drawings are especially relevant to support routing schemes in ad hoc wireless networks. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing succinctness. We introduce greedy rectilinear drawings, where edges are horizontal or vertical segments. These drawings have several properties that improve human readability and support network routing. Graph Drawing Elsevier Greedy drawings Elsevier Orthogonal drawings Elsevier Bekos, Michael A. oth Didimo, Walter oth Grilli, Luca oth Kindermann, Philipp oth Mchedlidze, Tamara oth Prutkin, Roman oth Symvonis, Antonios oth Tappini, Alessandra oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:795 year:2019 day:26 month:11 pages:375-397 extent:23 https://doi.org/10.1016/j.tcs.2019.07.019 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 795 2019 26 1126 375-397 23 |
| allfieldsSound |
10.1016/j.tcs.2019.07.019 doi GBV00000000000776.pica (DE-627)ELV048143944 (ELSEVIER)S0304-3975(19)30454-2 DE-627 ger DE-627 rakwb eng 620 VZ 690 VZ 50.92 bkl Angelini, Patrizio verfasserin aut Greedy rectilinear drawings 2019transfer abstract 23 nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. From an application perspective, greedy drawings are especially relevant to support routing schemes in ad hoc wireless networks. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing succinctness. We introduce greedy rectilinear drawings, where edges are horizontal or vertical segments. These drawings have several properties that improve human readability and support network routing. A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. From an application perspective, greedy drawings are especially relevant to support routing schemes in ad hoc wireless networks. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing succinctness. We introduce greedy rectilinear drawings, where edges are horizontal or vertical segments. These drawings have several properties that improve human readability and support network routing. Graph Drawing Elsevier Greedy drawings Elsevier Orthogonal drawings Elsevier Bekos, Michael A. oth Didimo, Walter oth Grilli, Luca oth Kindermann, Philipp oth Mchedlidze, Tamara oth Prutkin, Roman oth Symvonis, Antonios oth Tappini, Alessandra oth Enthalten in Elsevier Schweiss, Rüdiger ELSEVIER Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries 2015transfer abstract the journal of the EATCS Amsterdam [u.a.] (DE-627)ELV013125583 volume:795 year:2019 day:26 month:11 pages:375-397 extent:23 https://doi.org/10.1016/j.tcs.2019.07.019 Volltext GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 50.92 Meerestechnik VZ AR 795 2019 26 1126 375-397 23 |
| language |
English |
| source |
Enthalten in Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries Amsterdam [u.a.] volume:795 year:2019 day:26 month:11 pages:375-397 extent:23 |
| sourceStr |
Enthalten in Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries Amsterdam [u.a.] volume:795 year:2019 day:26 month:11 pages:375-397 extent:23 |
| format_phy_str_mv |
Article |
| bklname |
Meerestechnik |
| institution |
findex.gbv.de |
| topic_facet |
Graph Drawing Greedy drawings Orthogonal drawings |
| dewey-raw |
620 |
| isfreeaccess_bool |
false |
| container_title |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| authorswithroles_txt_mv |
Angelini, Patrizio @@aut@@ Bekos, Michael A. @@oth@@ Didimo, Walter @@oth@@ Grilli, Luca @@oth@@ Kindermann, Philipp @@oth@@ Mchedlidze, Tamara @@oth@@ Prutkin, Roman @@oth@@ Symvonis, Antonios @@oth@@ Tappini, Alessandra @@oth@@ |
| publishDateDaySort_date |
2019-01-26T00:00:00Z |
| hierarchy_top_id |
ELV013125583 |
| dewey-sort |
3620 |
| id |
ELV048143944 |
| 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">ELV048143944</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230626021255.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">191023s2019 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.tcs.2019.07.019</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBV00000000000776.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV048143944</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0304-3975(19)30454-2</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">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">690</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">50.92</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Angelini, Patrizio</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Greedy rectilinear drawings</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">23</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">A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. From an application perspective, greedy drawings are especially relevant to support routing schemes in ad hoc wireless networks. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing succinctness. We introduce greedy rectilinear drawings, where edges are horizontal or vertical segments. These drawings have several properties that improve human readability and support network routing.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. From an application perspective, greedy drawings are especially relevant to support routing schemes in ad hoc wireless networks. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing succinctness. We introduce greedy rectilinear drawings, where edges are horizontal or vertical segments. These drawings have several properties that improve human readability and support network routing.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graph Drawing</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Greedy drawings</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Orthogonal drawings</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bekos, Michael A.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Didimo, Walter</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Grilli, Luca</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kindermann, Philipp</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mchedlidze, Tamara</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Prutkin, Roman</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Symvonis, Antonios</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tappini, Alessandra</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">Schweiss, Rüdiger ELSEVIER</subfield><subfield code="t">Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries</subfield><subfield code="d">2015transfer abstract</subfield><subfield code="d">the journal of the EATCS</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV013125583</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:795</subfield><subfield code="g">year:2019</subfield><subfield code="g">day:26</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:375-397</subfield><subfield code="g">extent:23</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.tcs.2019.07.019</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">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">50.92</subfield><subfield code="j">Meerestechnik</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">795</subfield><subfield code="j">2019</subfield><subfield code="b">26</subfield><subfield code="c">1126</subfield><subfield code="h">375-397</subfield><subfield code="g">23</subfield></datafield></record></collection>
|
| author |
Angelini, Patrizio |
| spellingShingle |
Angelini, Patrizio ddc 620 ddc 690 bkl 50.92 Elsevier Graph Drawing Elsevier Greedy drawings Elsevier Orthogonal drawings Greedy rectilinear drawings |
| authorStr |
Angelini, Patrizio |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)ELV013125583 |
| format |
electronic Article |
| dewey-ones |
620 - Engineering & allied operations 690 - Buildings |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
elsevier |
| remote_str |
true |
| illustrated |
Not Illustrated |
| topic_title |
620 VZ 690 VZ 50.92 bkl Greedy rectilinear drawings Graph Drawing Elsevier Greedy drawings Elsevier Orthogonal drawings Elsevier |
| topic |
ddc 620 ddc 690 bkl 50.92 Elsevier Graph Drawing Elsevier Greedy drawings Elsevier Orthogonal drawings |
| topic_unstemmed |
ddc 620 ddc 690 bkl 50.92 Elsevier Graph Drawing Elsevier Greedy drawings Elsevier Orthogonal drawings |
| topic_browse |
ddc 620 ddc 690 bkl 50.92 Elsevier Graph Drawing Elsevier Greedy drawings Elsevier Orthogonal drawings |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| author2_variant |
m a b ma mab w d wd l g lg p k pk t m tm r p rp a s as a t at |
| hierarchy_parent_title |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| hierarchy_parent_id |
ELV013125583 |
| dewey-tens |
620 - Engineering 690 - Building & construction |
| hierarchy_top_title |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)ELV013125583 |
| title |
Greedy rectilinear drawings |
| ctrlnum |
(DE-627)ELV048143944 (ELSEVIER)S0304-3975(19)30454-2 |
| title_full |
Greedy rectilinear drawings |
| author_sort |
Angelini, Patrizio |
| journal |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| journalStr |
Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
600 - Technology |
| recordtype |
marc |
| publishDateSort |
2019 |
| contenttype_str_mv |
zzz |
| container_start_page |
375 |
| author_browse |
Angelini, Patrizio |
| container_volume |
795 |
| physical |
23 |
| class |
620 VZ 690 VZ 50.92 bkl |
| format_se |
Elektronische Aufsätze |
| author-letter |
Angelini, Patrizio |
| doi_str_mv |
10.1016/j.tcs.2019.07.019 |
| dewey-full |
620 690 |
| title_sort |
greedy rectilinear drawings |
| title_auth |
Greedy rectilinear drawings |
| abstract |
A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. From an application perspective, greedy drawings are especially relevant to support routing schemes in ad hoc wireless networks. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing succinctness. We introduce greedy rectilinear drawings, where edges are horizontal or vertical segments. These drawings have several properties that improve human readability and support network routing. |
| abstractGer |
A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. From an application perspective, greedy drawings are especially relevant to support routing schemes in ad hoc wireless networks. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing succinctness. We introduce greedy rectilinear drawings, where edges are horizontal or vertical segments. These drawings have several properties that improve human readability and support network routing. |
| abstract_unstemmed |
A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. From an application perspective, greedy drawings are especially relevant to support routing schemes in ad hoc wireless networks. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing succinctness. We introduce greedy rectilinear drawings, where edges are horizontal or vertical segments. These drawings have several properties that improve human readability and support network routing. |
| collection_details |
GBV_USEFLAG_U GBV_ELV SYSFLAG_U GBV_ILN_22 GBV_ILN_40 |
| title_short |
Greedy rectilinear drawings |
| url |
https://doi.org/10.1016/j.tcs.2019.07.019 |
| remote_bool |
true |
| author2 |
Bekos, Michael A. Didimo, Walter Grilli, Luca Kindermann, Philipp Mchedlidze, Tamara Prutkin, Roman Symvonis, Antonios Tappini, Alessandra |
| author2Str |
Bekos, Michael A. Didimo, Walter Grilli, Luca Kindermann, Philipp Mchedlidze, Tamara Prutkin, Roman Symvonis, Antonios Tappini, Alessandra |
| ppnlink |
ELV013125583 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth oth oth oth oth oth oth |
| doi_str |
10.1016/j.tcs.2019.07.019 |
| up_date |
2024-07-06T18:03:22.561Z |
| _version_ |
1803853761150451712 |
| 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">ELV048143944</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230626021255.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">191023s2019 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.tcs.2019.07.019</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">GBV00000000000776.pica</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV048143944</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0304-3975(19)30454-2</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">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">690</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">50.92</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Angelini, Patrizio</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Greedy rectilinear drawings</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019transfer abstract</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">23</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">A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. From an application perspective, greedy drawings are especially relevant to support routing schemes in ad hoc wireless networks. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing succinctness. We introduce greedy rectilinear drawings, where edges are horizontal or vertical segments. These drawings have several properties that improve human readability and support network routing.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. From an application perspective, greedy drawings are especially relevant to support routing schemes in ad hoc wireless networks. The existence of greedy drawings has been widely studied under different topological and geometric constraints, such as planarity, face convexity, and drawing succinctness. We introduce greedy rectilinear drawings, where edges are horizontal or vertical segments. These drawings have several properties that improve human readability and support network routing.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graph Drawing</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Greedy drawings</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Orthogonal drawings</subfield><subfield code="2">Elsevier</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bekos, Michael A.</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Didimo, Walter</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Grilli, Luca</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kindermann, Philipp</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mchedlidze, Tamara</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Prutkin, Roman</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Symvonis, Antonios</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tappini, Alessandra</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">Schweiss, Rüdiger ELSEVIER</subfield><subfield code="t">Influence of bulk fibre properties of PAN-based carbon felts on their performance in vanadium redox flow batteries</subfield><subfield code="d">2015transfer abstract</subfield><subfield code="d">the journal of the EATCS</subfield><subfield code="g">Amsterdam [u.a.]</subfield><subfield code="w">(DE-627)ELV013125583</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:795</subfield><subfield code="g">year:2019</subfield><subfield code="g">day:26</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:375-397</subfield><subfield code="g">extent:23</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1016/j.tcs.2019.07.019</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">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">50.92</subfield><subfield code="j">Meerestechnik</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">795</subfield><subfield code="j">2019</subfield><subfield code="b">26</subfield><subfield code="c">1126</subfield><subfield code="h">375-397</subfield><subfield code="g">23</subfield></datafield></record></collection>
|
| score |
7.398368 |