Heuristic algorithms for finding inexpensive elimination schemes
Abstract The computational cost, in both storage requirements and calculation, of performing an elimination ordering is considered as a function of the order in which the vertices of a graph are eliminated. Several different heuristic and relaxed heuristic algorithms for finding low cost elimination...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Harbron, Chris [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
1995 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Chapman & Hall 1995 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Statistics and computing - Kluwer Academic Publishers, 1991, 5(1995), 4 vom: Dez., Seite 275-287 |
|---|---|
| Übergeordnetes Werk: |
volume:5 ; year:1995 ; number:4 ; month:12 ; pages:275-287 |
| Links: |
|---|
| DOI / URN: |
10.1007/BF00162500 |
|---|
| Katalog-ID: |
OLC2033738728 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2033738728 | ||
| 003 | DE-627 | ||
| 005 | 20230504051349.0 | ||
| 007 | tu | ||
| 008 | 200819s1995 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/BF00162500 |2 doi | |
| 035 | |a (DE-627)OLC2033738728 | ||
| 035 | |a (DE-He213)BF00162500-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |a 620 |q VZ |
| 100 | 1 | |a Harbron, Chris |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Heuristic algorithms for finding inexpensive elimination schemes |
| 264 | 1 | |c 1995 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Chapman & Hall 1995 | ||
| 520 | |a Abstract The computational cost, in both storage requirements and calculation, of performing an elimination ordering is considered as a function of the order in which the vertices of a graph are eliminated. Several different heuristic and relaxed heuristic algorithms for finding low cost elimination orderings are described and compared. The new heuristic and relaxed heuristic algorithms proposed in this paper are shown to find computationally more efficient elimination orderings than previously proposed heuristic algorithms. | ||
| 650 | 4 | |a Graph triangulation | |
| 650 | 4 | |a probabilistic networks | |
| 650 | 4 | |a pedigree analysis | |
| 650 | 4 | |a peeling | |
| 773 | 0 | 8 | |i Enthalten in |t Statistics and computing |d Kluwer Academic Publishers, 1991 |g 5(1995), 4 vom: Dez., Seite 275-287 |w (DE-627)131007963 |w (DE-600)1087487-2 |w (DE-576)052732894 |x 0960-3174 |7 nnns |
| 773 | 1 | 8 | |g volume:5 |g year:1995 |g number:4 |g month:12 |g pages:275-287 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/BF00162500 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-TEC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_11 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_4126 | ||
| 951 | |a AR | ||
| 952 | |d 5 |j 1995 |e 4 |c 12 |h 275-287 | ||
| author_variant |
c h ch |
|---|---|
| matchkey_str |
article:09603174:1995----::ersiagrtmfridniepniel |
| hierarchy_sort_str |
1995 |
| publishDate |
1995 |
| allfields |
10.1007/BF00162500 doi (DE-627)OLC2033738728 (DE-He213)BF00162500-p DE-627 ger DE-627 rakwb eng 004 620 VZ Harbron, Chris verfasserin aut Heuristic algorithms for finding inexpensive elimination schemes 1995 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Chapman & Hall 1995 Abstract The computational cost, in both storage requirements and calculation, of performing an elimination ordering is considered as a function of the order in which the vertices of a graph are eliminated. Several different heuristic and relaxed heuristic algorithms for finding low cost elimination orderings are described and compared. The new heuristic and relaxed heuristic algorithms proposed in this paper are shown to find computationally more efficient elimination orderings than previously proposed heuristic algorithms. Graph triangulation probabilistic networks pedigree analysis peeling Enthalten in Statistics and computing Kluwer Academic Publishers, 1991 5(1995), 4 vom: Dez., Seite 275-287 (DE-627)131007963 (DE-600)1087487-2 (DE-576)052732894 0960-3174 nnns volume:5 year:1995 number:4 month:12 pages:275-287 https://doi.org/10.1007/BF00162500 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_11 GBV_ILN_70 GBV_ILN_4126 AR 5 1995 4 12 275-287 |
| spelling |
10.1007/BF00162500 doi (DE-627)OLC2033738728 (DE-He213)BF00162500-p DE-627 ger DE-627 rakwb eng 004 620 VZ Harbron, Chris verfasserin aut Heuristic algorithms for finding inexpensive elimination schemes 1995 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Chapman & Hall 1995 Abstract The computational cost, in both storage requirements and calculation, of performing an elimination ordering is considered as a function of the order in which the vertices of a graph are eliminated. Several different heuristic and relaxed heuristic algorithms for finding low cost elimination orderings are described and compared. The new heuristic and relaxed heuristic algorithms proposed in this paper are shown to find computationally more efficient elimination orderings than previously proposed heuristic algorithms. Graph triangulation probabilistic networks pedigree analysis peeling Enthalten in Statistics and computing Kluwer Academic Publishers, 1991 5(1995), 4 vom: Dez., Seite 275-287 (DE-627)131007963 (DE-600)1087487-2 (DE-576)052732894 0960-3174 nnns volume:5 year:1995 number:4 month:12 pages:275-287 https://doi.org/10.1007/BF00162500 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_11 GBV_ILN_70 GBV_ILN_4126 AR 5 1995 4 12 275-287 |
| allfields_unstemmed |
10.1007/BF00162500 doi (DE-627)OLC2033738728 (DE-He213)BF00162500-p DE-627 ger DE-627 rakwb eng 004 620 VZ Harbron, Chris verfasserin aut Heuristic algorithms for finding inexpensive elimination schemes 1995 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Chapman & Hall 1995 Abstract The computational cost, in both storage requirements and calculation, of performing an elimination ordering is considered as a function of the order in which the vertices of a graph are eliminated. Several different heuristic and relaxed heuristic algorithms for finding low cost elimination orderings are described and compared. The new heuristic and relaxed heuristic algorithms proposed in this paper are shown to find computationally more efficient elimination orderings than previously proposed heuristic algorithms. Graph triangulation probabilistic networks pedigree analysis peeling Enthalten in Statistics and computing Kluwer Academic Publishers, 1991 5(1995), 4 vom: Dez., Seite 275-287 (DE-627)131007963 (DE-600)1087487-2 (DE-576)052732894 0960-3174 nnns volume:5 year:1995 number:4 month:12 pages:275-287 https://doi.org/10.1007/BF00162500 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_11 GBV_ILN_70 GBV_ILN_4126 AR 5 1995 4 12 275-287 |
| allfieldsGer |
10.1007/BF00162500 doi (DE-627)OLC2033738728 (DE-He213)BF00162500-p DE-627 ger DE-627 rakwb eng 004 620 VZ Harbron, Chris verfasserin aut Heuristic algorithms for finding inexpensive elimination schemes 1995 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Chapman & Hall 1995 Abstract The computational cost, in both storage requirements and calculation, of performing an elimination ordering is considered as a function of the order in which the vertices of a graph are eliminated. Several different heuristic and relaxed heuristic algorithms for finding low cost elimination orderings are described and compared. The new heuristic and relaxed heuristic algorithms proposed in this paper are shown to find computationally more efficient elimination orderings than previously proposed heuristic algorithms. Graph triangulation probabilistic networks pedigree analysis peeling Enthalten in Statistics and computing Kluwer Academic Publishers, 1991 5(1995), 4 vom: Dez., Seite 275-287 (DE-627)131007963 (DE-600)1087487-2 (DE-576)052732894 0960-3174 nnns volume:5 year:1995 number:4 month:12 pages:275-287 https://doi.org/10.1007/BF00162500 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_11 GBV_ILN_70 GBV_ILN_4126 AR 5 1995 4 12 275-287 |
| allfieldsSound |
10.1007/BF00162500 doi (DE-627)OLC2033738728 (DE-He213)BF00162500-p DE-627 ger DE-627 rakwb eng 004 620 VZ Harbron, Chris verfasserin aut Heuristic algorithms for finding inexpensive elimination schemes 1995 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Chapman & Hall 1995 Abstract The computational cost, in both storage requirements and calculation, of performing an elimination ordering is considered as a function of the order in which the vertices of a graph are eliminated. Several different heuristic and relaxed heuristic algorithms for finding low cost elimination orderings are described and compared. The new heuristic and relaxed heuristic algorithms proposed in this paper are shown to find computationally more efficient elimination orderings than previously proposed heuristic algorithms. Graph triangulation probabilistic networks pedigree analysis peeling Enthalten in Statistics and computing Kluwer Academic Publishers, 1991 5(1995), 4 vom: Dez., Seite 275-287 (DE-627)131007963 (DE-600)1087487-2 (DE-576)052732894 0960-3174 nnns volume:5 year:1995 number:4 month:12 pages:275-287 https://doi.org/10.1007/BF00162500 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_11 GBV_ILN_70 GBV_ILN_4126 AR 5 1995 4 12 275-287 |
| language |
English |
| source |
Enthalten in Statistics and computing 5(1995), 4 vom: Dez., Seite 275-287 volume:5 year:1995 number:4 month:12 pages:275-287 |
| sourceStr |
Enthalten in Statistics and computing 5(1995), 4 vom: Dez., Seite 275-287 volume:5 year:1995 number:4 month:12 pages:275-287 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Graph triangulation probabilistic networks pedigree analysis peeling |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Statistics and computing |
| authorswithroles_txt_mv |
Harbron, Chris @@aut@@ |
| publishDateDaySort_date |
1995-12-01T00:00:00Z |
| hierarchy_top_id |
131007963 |
| dewey-sort |
14 |
| id |
OLC2033738728 |
| 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">OLC2033738728</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504051349.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s1995 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF00162500</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2033738728</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF00162500-p</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">004</subfield><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Harbron, Chris</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Heuristic algorithms for finding inexpensive elimination schemes</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1995</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">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Chapman & Hall 1995</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The computational cost, in both storage requirements and calculation, of performing an elimination ordering is considered as a function of the order in which the vertices of a graph are eliminated. Several different heuristic and relaxed heuristic algorithms for finding low cost elimination orderings are described and compared. The new heuristic and relaxed heuristic algorithms proposed in this paper are shown to find computationally more efficient elimination orderings than previously proposed heuristic algorithms.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph triangulation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">probabilistic networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">pedigree analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">peeling</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Statistics and computing</subfield><subfield code="d">Kluwer Academic Publishers, 1991</subfield><subfield code="g">5(1995), 4 vom: Dez., Seite 275-287</subfield><subfield code="w">(DE-627)131007963</subfield><subfield code="w">(DE-600)1087487-2</subfield><subfield code="w">(DE-576)052732894</subfield><subfield code="x">0960-3174</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:5</subfield><subfield code="g">year:1995</subfield><subfield code="g">number:4</subfield><subfield code="g">month:12</subfield><subfield code="g">pages:275-287</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF00162500</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</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_4126</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">5</subfield><subfield code="j">1995</subfield><subfield code="e">4</subfield><subfield code="c">12</subfield><subfield code="h">275-287</subfield></datafield></record></collection>
|
| author |
Harbron, Chris |
| spellingShingle |
Harbron, Chris ddc 004 misc Graph triangulation misc probabilistic networks misc pedigree analysis misc peeling Heuristic algorithms for finding inexpensive elimination schemes |
| authorStr |
Harbron, Chris |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)131007963 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science 620 - Engineering & allied operations |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0960-3174 |
| topic_title |
004 620 VZ Heuristic algorithms for finding inexpensive elimination schemes Graph triangulation probabilistic networks pedigree analysis peeling |
| topic |
ddc 004 misc Graph triangulation misc probabilistic networks misc pedigree analysis misc peeling |
| topic_unstemmed |
ddc 004 misc Graph triangulation misc probabilistic networks misc pedigree analysis misc peeling |
| topic_browse |
ddc 004 misc Graph triangulation misc probabilistic networks misc pedigree analysis misc peeling |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Statistics and computing |
| hierarchy_parent_id |
131007963 |
| dewey-tens |
000 - Computer science, knowledge & systems 620 - Engineering |
| hierarchy_top_title |
Statistics and computing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)131007963 (DE-600)1087487-2 (DE-576)052732894 |
| title |
Heuristic algorithms for finding inexpensive elimination schemes |
| ctrlnum |
(DE-627)OLC2033738728 (DE-He213)BF00162500-p |
| title_full |
Heuristic algorithms for finding inexpensive elimination schemes |
| author_sort |
Harbron, Chris |
| journal |
Statistics and computing |
| journalStr |
Statistics and computing |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 600 - Technology |
| recordtype |
marc |
| publishDateSort |
1995 |
| contenttype_str_mv |
txt |
| container_start_page |
275 |
| author_browse |
Harbron, Chris |
| container_volume |
5 |
| class |
004 620 VZ |
| format_se |
Aufsätze |
| author-letter |
Harbron, Chris |
| doi_str_mv |
10.1007/BF00162500 |
| dewey-full |
004 620 |
| title_sort |
heuristic algorithms for finding inexpensive elimination schemes |
| title_auth |
Heuristic algorithms for finding inexpensive elimination schemes |
| abstract |
Abstract The computational cost, in both storage requirements and calculation, of performing an elimination ordering is considered as a function of the order in which the vertices of a graph are eliminated. Several different heuristic and relaxed heuristic algorithms for finding low cost elimination orderings are described and compared. The new heuristic and relaxed heuristic algorithms proposed in this paper are shown to find computationally more efficient elimination orderings than previously proposed heuristic algorithms. © Chapman & Hall 1995 |
| abstractGer |
Abstract The computational cost, in both storage requirements and calculation, of performing an elimination ordering is considered as a function of the order in which the vertices of a graph are eliminated. Several different heuristic and relaxed heuristic algorithms for finding low cost elimination orderings are described and compared. The new heuristic and relaxed heuristic algorithms proposed in this paper are shown to find computationally more efficient elimination orderings than previously proposed heuristic algorithms. © Chapman & Hall 1995 |
| abstract_unstemmed |
Abstract The computational cost, in both storage requirements and calculation, of performing an elimination ordering is considered as a function of the order in which the vertices of a graph are eliminated. Several different heuristic and relaxed heuristic algorithms for finding low cost elimination orderings are described and compared. The new heuristic and relaxed heuristic algorithms proposed in this paper are shown to find computationally more efficient elimination orderings than previously proposed heuristic algorithms. © Chapman & Hall 1995 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_11 GBV_ILN_70 GBV_ILN_4126 |
| container_issue |
4 |
| title_short |
Heuristic algorithms for finding inexpensive elimination schemes |
| url |
https://doi.org/10.1007/BF00162500 |
| remote_bool |
false |
| ppnlink |
131007963 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/BF00162500 |
| up_date |
2024-07-03T18:14:49.974Z |
| _version_ |
1803582691053928448 |
| 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">OLC2033738728</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504051349.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s1995 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF00162500</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2033738728</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF00162500-p</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">004</subfield><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Harbron, Chris</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Heuristic algorithms for finding inexpensive elimination schemes</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1995</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">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Chapman & Hall 1995</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The computational cost, in both storage requirements and calculation, of performing an elimination ordering is considered as a function of the order in which the vertices of a graph are eliminated. Several different heuristic and relaxed heuristic algorithms for finding low cost elimination orderings are described and compared. The new heuristic and relaxed heuristic algorithms proposed in this paper are shown to find computationally more efficient elimination orderings than previously proposed heuristic algorithms.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph triangulation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">probabilistic networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">pedigree analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">peeling</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Statistics and computing</subfield><subfield code="d">Kluwer Academic Publishers, 1991</subfield><subfield code="g">5(1995), 4 vom: Dez., Seite 275-287</subfield><subfield code="w">(DE-627)131007963</subfield><subfield code="w">(DE-600)1087487-2</subfield><subfield code="w">(DE-576)052732894</subfield><subfield code="x">0960-3174</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:5</subfield><subfield code="g">year:1995</subfield><subfield code="g">number:4</subfield><subfield code="g">month:12</subfield><subfield code="g">pages:275-287</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF00162500</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</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_4126</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">5</subfield><subfield code="j">1995</subfield><subfield code="e">4</subfield><subfield code="c">12</subfield><subfield code="h">275-287</subfield></datafield></record></collection>
|
| score |
7.4008856 |