Computational aspects of coherent algebras:
Abstract: "Coherent algebras are a very promising tool to get more insight into the graph isomorphism problem. This paper deals with the aspect of computing the coherent algebra which is generated by some matrices A, ..., A[subscript m] of dimension n x n. It is proved that the well known Weisf...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | German |
| Published: |
München
1994
|
| Series: | Technische Universität <München>: TUM-MATH
9406 |
| Subjects: | |
| Summary: | Abstract: "Coherent algebras are a very promising tool to get more insight into the graph isomorphism problem. This paper deals with the aspect of computing the coherent algebra which is generated by some matrices A, ..., A[subscript m] of dimension n x n. It is proved that the well known Weisfeiler-Lehman algorithm can be implemented to run in time O((m+n)n²log n). Using a graphtheoretic formulation of the properties of coherent algebras we present an improved version of this algorithm. We further point out a relationship of coherent algebras and total degree partitions which also play an important role for the graph isomorphism problem." |
| Physical Description: | 13 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010164499 | ||
| 003 | DE-604 | ||
| 005 | 20200805 | ||
| 007 | t | ||
| 008 | 950424s1994 gw t||| 00||| ger d | ||
| 016 | 7 | |a 943969603 |2 DE-101 | |
| 035 | |a (OCoLC)34870147 | ||
| 035 | |a (DE-599)BVBBV010164499 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-12 |a DE-91G | ||
| 088 | |a TUM M 9406 | ||
| 100 | 1 | |a Babel, Luitpold |d 1962- |e Verfasser |0 (DE-588)1215213646 |4 aut | |
| 245 | 1 | 0 | |a Computational aspects of coherent algebras |c Luitpold Babel |
| 264 | 1 | |a München |c 1994 | |
| 300 | |a 13 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Technische Universität <München>: TUM-MATH |v 9406 | |
| 520 | 3 | |a Abstract: "Coherent algebras are a very promising tool to get more insight into the graph isomorphism problem. This paper deals with the aspect of computing the coherent algebra which is generated by some matrices A, ..., A[subscript m] of dimension n x n. It is proved that the well known Weisfeiler-Lehman algorithm can be implemented to run in time O((m+n)n²log n). Using a graphtheoretic formulation of the properties of coherent algebras we present an improved version of this algorithm. We further point out a relationship of coherent algebras and total degree partitions which also play an important role for the graph isomorphism problem." | |
| 650 | 4 | |a Graph theory | |
| 650 | 4 | |a Isomorphisms (Mathematics) | |
| 650 | 4 | |a Matrices | |
| 650 | 4 | |a Partitions (Mathematics) | |
| 830 | 0 | |a Technische Universität <München>: TUM-MATH |v 9406 |w (DE-604)BV006186461 |9 9406 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006750037 | ||
Record in the Search Index
| _version_ | 1804124559370092544 |
|---|---|
| any_adam_object | |
| author | Babel, Luitpold 1962- |
| author_GND | (DE-588)1215213646 |
| author_facet | Babel, Luitpold 1962- |
| author_role | aut |
| author_sort | Babel, Luitpold 1962- |
| author_variant | l b lb |
| building | Verbundindex |
| bvnumber | BV010164499 |
| ctrlnum | (OCoLC)34870147 (DE-599)BVBBV010164499 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01716nam a2200361 cb4500</leader><controlfield tag="001">BV010164499</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200805 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950424s1994 gw t||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">943969603</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)34870147</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010164499</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">TUM M 9406</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Babel, Luitpold</subfield><subfield code="d">1962-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1215213646</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computational aspects of coherent algebras</subfield><subfield code="c">Luitpold Babel</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">München</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">13 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Technische Universität <München>: TUM-MATH</subfield><subfield code="v">9406</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Coherent algebras are a very promising tool to get more insight into the graph isomorphism problem. This paper deals with the aspect of computing the coherent algebra which is generated by some matrices A, ..., A[subscript m] of dimension n x n. It is proved that the well known Weisfeiler-Lehman algorithm can be implemented to run in time O((m+n)n²log n). Using a graphtheoretic formulation of the properties of coherent algebras we present an improved version of this algorithm. We further point out a relationship of coherent algebras and total degree partitions which also play an important role for the graph isomorphism problem."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Isomorphisms (Mathematics)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Matrices</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Partitions (Mathematics)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Technische Universität <München>: TUM-MATH</subfield><subfield code="v">9406</subfield><subfield code="w">(DE-604)BV006186461</subfield><subfield code="9">9406</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006750037</subfield></datafield></record></collection> |
| id | DE-604.BV010164499 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:47:35Z |
| institution | BVB |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006750037 |
| oclc_num | 34870147 |
| open_access_boolean | |
| owner | DE-12 DE-91G DE-BY-TUM |
| owner_facet | DE-12 DE-91G DE-BY-TUM |
| physical | 13 S. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| record_format | marc |
| series | Technische Universität <München>: TUM-MATH |
| series2 | Technische Universität <München>: TUM-MATH |
| spelling | Babel, Luitpold 1962- Verfasser (DE-588)1215213646 aut Computational aspects of coherent algebras Luitpold Babel München 1994 13 S. txt rdacontent n rdamedia nc rdacarrier Technische Universität <München>: TUM-MATH 9406 Abstract: "Coherent algebras are a very promising tool to get more insight into the graph isomorphism problem. This paper deals with the aspect of computing the coherent algebra which is generated by some matrices A, ..., A[subscript m] of dimension n x n. It is proved that the well known Weisfeiler-Lehman algorithm can be implemented to run in time O((m+n)n²log n). Using a graphtheoretic formulation of the properties of coherent algebras we present an improved version of this algorithm. We further point out a relationship of coherent algebras and total degree partitions which also play an important role for the graph isomorphism problem." Graph theory Isomorphisms (Mathematics) Matrices Partitions (Mathematics) Technische Universität <München>: TUM-MATH 9406 (DE-604)BV006186461 9406 |
| spellingShingle | Babel, Luitpold 1962- Computational aspects of coherent algebras Technische Universität <München>: TUM-MATH Graph theory Isomorphisms (Mathematics) Matrices Partitions (Mathematics) |
| title | Computational aspects of coherent algebras |
| title_auth | Computational aspects of coherent algebras |
| title_exact_search | Computational aspects of coherent algebras |
| title_full | Computational aspects of coherent algebras Luitpold Babel |
| title_fullStr | Computational aspects of coherent algebras Luitpold Babel |
| title_full_unstemmed | Computational aspects of coherent algebras Luitpold Babel |
| title_short | Computational aspects of coherent algebras |
| title_sort | computational aspects of coherent algebras |
| topic | Graph theory Isomorphisms (Mathematics) Matrices Partitions (Mathematics) |
| topic_facet | Graph theory Isomorphisms (Mathematics) Matrices Partitions (Mathematics) |
| volume_link | (DE-604)BV006186461 |
| work_keys_str_mv | AT babelluitpold computationalaspectsofcoherentalgebras |