Graph Algorithms and Applications
The mixture of data in real-life exhibits structure or connection property in nature. Typical data include biological data, communication network data, image data, etc. Graphs provide a natural way to represent and analyze these types of data and their relationships. Unfortunately, the related algor...
Saved in:
| HerausgeberIn: | |
|---|---|
| Sonstige: | |
| Year of Publication: | 2022 |
| Language: | English |
| Physical Description: | 1 electronic resource (106 p.) |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
993544774504498 |
|---|---|
| ctrlnum |
(CKB)5680000000037811 (oapen)https://directory.doabooks.org/handle/20.500.12854/81106 (EXLCZ)995680000000037811 |
| collection |
bib_alma |
| record_format |
marc |
| spelling |
Stefano, Gabriele Di edt Graph Algorithms and Applications Basel MDPI - Multidisciplinary Digital Publishing Institute 2022 1 electronic resource (106 p.) text txt rdacontent computer c rdamedia online resource cr rdacarrier The mixture of data in real-life exhibits structure or connection property in nature. Typical data include biological data, communication network data, image data, etc. Graphs provide a natural way to represent and analyze these types of data and their relationships. Unfortunately, the related algorithms usually suffer from high computational complexity, since some of these problems are NP-hard. Therefore, in recent years, many graph models and optimization algorithms have been proposed to achieve a better balance between efficacy and efficiency. This book contains some papers reporting recent achievements regarding graph models, algorithms, and applications to problems in the real world, with some focus on optimization and computational complexity. English Information technology industries bicssc Computer science bicssc planar graphs k-planarity NP-hardness polynomial time reduction cliques paths computational social choice election control multi-winner election social influence influence maximization congestion games pure Nash equilibrium potential games price of anarchy price of stability phylogenetic tree evolutionary tree ancestral mixture model mixture tree mixture distance tree comparison clique independent set clique transversal number signed clique transversal function minus clique transversal function k-fold clique transversal set distance-hereditary graphs stretch number recognition problem forbidden subgraphs hole detection analysis and design or graph algorithms distributed graph and network algorithms graph theory with algorithmic applications computational complexity of graph problems experimental evaluation of graph algorithms 3-0365-1542-9 3-0365-1541-0 Cicerone, Serafino edt Stefano, Gabriele Di oth Cicerone, Serafino oth |
| language |
English |
| format |
eBook |
| author2 |
Cicerone, Serafino Stefano, Gabriele Di Cicerone, Serafino |
| author_facet |
Cicerone, Serafino Stefano, Gabriele Di Cicerone, Serafino |
| author2_variant |
g d s gd gds s c sc |
| author2_role |
HerausgeberIn Sonstige Sonstige |
| title |
Graph Algorithms and Applications |
| spellingShingle |
Graph Algorithms and Applications |
| title_full |
Graph Algorithms and Applications |
| title_fullStr |
Graph Algorithms and Applications |
| title_full_unstemmed |
Graph Algorithms and Applications |
| title_auth |
Graph Algorithms and Applications |
| title_new |
Graph Algorithms and Applications |
| title_sort |
graph algorithms and applications |
| publisher |
MDPI - Multidisciplinary Digital Publishing Institute |
| publishDate |
2022 |
| physical |
1 electronic resource (106 p.) |
| isbn |
3-0365-1542-9 3-0365-1541-0 |
| illustrated |
Not Illustrated |
| work_keys_str_mv |
AT stefanogabrieledi graphalgorithmsandapplications AT ciceroneserafino graphalgorithmsandapplications |
| status_str |
n |
| ids_txt_mv |
(CKB)5680000000037811 (oapen)https://directory.doabooks.org/handle/20.500.12854/81106 (EXLCZ)995680000000037811 |
| carrierType_str_mv |
cr |
| is_hierarchy_title |
Graph Algorithms and Applications |
| author2_original_writing_str_mv |
noLinkedField noLinkedField noLinkedField |
| _version_ |
1796649061598625792 |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03213nam-a2200769z--4500</leader><controlfield tag="001">993544774504498</controlfield><controlfield tag="005">20231214133247.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr|mn|---annan</controlfield><controlfield tag="008">202205s2022 xx |||||o ||| 0|eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CKB)5680000000037811</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(oapen)https://directory.doabooks.org/handle/20.500.12854/81106</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EXLCZ)995680000000037811</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Stefano, Gabriele Di</subfield><subfield code="4">edt</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Graph Algorithms and Applications</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Basel</subfield><subfield code="b">MDPI - Multidisciplinary Digital Publishing Institute</subfield><subfield code="c">2022</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 electronic resource (106 p.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The mixture of data in real-life exhibits structure or connection property in nature. Typical data include biological data, communication network data, image data, etc. Graphs provide a natural way to represent and analyze these types of data and their relationships. Unfortunately, the related algorithms usually suffer from high computational complexity, since some of these problems are NP-hard. Therefore, in recent years, many graph models and optimization algorithms have been proposed to achieve a better balance between efficacy and efficiency. This book contains some papers reporting recent achievements regarding graph models, algorithms, and applications to problems in the real world, with some focus on optimization and computational complexity.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Information technology industries</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer science</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">planar graphs</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">k-planarity</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">NP-hardness</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">polynomial time reduction</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">cliques</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">paths</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">computational social choice</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">election control</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">multi-winner election</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">social influence</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">influence maximization</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">congestion games</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">pure Nash equilibrium</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">potential games</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">price of anarchy</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">price of stability</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">phylogenetic tree</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">evolutionary tree</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">ancestral mixture model</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">mixture tree</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">mixture distance</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">tree comparison</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">clique independent set</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">clique transversal number</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">signed clique transversal function</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">minus clique transversal function</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">k-fold clique transversal set</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">distance-hereditary graphs</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">stretch number</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">recognition problem</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">forbidden subgraphs</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">hole detection</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">analysis and design or graph algorithms</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">distributed graph and network algorithms</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">graph theory with algorithmic applications</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">computational complexity of graph problems</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">experimental evaluation of graph algorithms</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">3-0365-1542-9</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">3-0365-1541-0</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cicerone, Serafino</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Stefano, Gabriele Di</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cicerone, Serafino</subfield><subfield code="4">oth</subfield></datafield><datafield tag="906" ind1=" " ind2=" "><subfield code="a">BOOK</subfield></datafield><datafield tag="ADM" ind1=" " ind2=" "><subfield code="b">2023-12-15 05:48:18 Europe/Vienna</subfield><subfield code="f">system</subfield><subfield code="c">marc21</subfield><subfield code="a">2022-05-14 21:41:54 Europe/Vienna</subfield><subfield code="g">false</subfield></datafield><datafield tag="AVE" ind1=" " ind2=" "><subfield code="i">DOAB Directory of Open Access Books</subfield><subfield code="P">DOAB Directory of Open Access Books</subfield><subfield code="x">https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&portfolio_pid=5337724910004498&Force_direct=true</subfield><subfield code="Z">5337724910004498</subfield><subfield code="b">Available</subfield><subfield code="8">5337724910004498</subfield></datafield></record></collection> |