Finding all maximal cliques of a family of induced subgraphs:
Abstract: "Many real world problems can be mapped onto graphs and solved with well-established efficient algorithms studied in graph theory. One such problem is the following: given a set of objects and an irreflexive and symmetric relation between these objects, find maximal subsets whose elem...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin
Konrad-Zuse-Zentrum für Informationstechnik
2003
|
| Schriftenreihe: | ZIB-Report
2003,53 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Many real world problems can be mapped onto graphs and solved with well-established efficient algorithms studied in graph theory. One such problem is the following: given a set of objects and an irreflexive and symmetric relation between these objects, find maximal subsets whose elements mutually satisfy this relation. This problem can be transformed to the problem of finding all cliques of an undirected graph by mapping each object onto a vertex of the graph and connecting any two vertices by an edge whose corresponding objects satisfy the given relation. In this paper we study a related problem, where all objects have a set of binary attributes, each of which is either 0 or 1. We want to find maximal subsets of objects not only mutually satisfying a given relation; but, in addition, all objects of a subset also need to have at least one common attribute with value 1. This problem can be mapped onto a set of induced subgraphs, where each subgraph represents a single attribute. For attribute i, its associated subgraph contains those vertices corresponding to the objects with attribute i set to 1. We introduce the notion of a maximal clique of a family, G, of induced subgraphs of an undirected graph, and show that determining all maximal cliques of G solves our problem. Furthermore, we present an efficient algorithm to compute all maximal cliques of G. The algorithm we propose is an extension of the widely used Bron-Kerbosch algorithm [6]." |
| Beschreibung: | 14 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV019409403 | ||
| 003 | DE-604 | ||
| 005 | 20060111 | ||
| 007 | t| | ||
| 008 | 041001s2003 xx d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)57072777 | ||
| 035 | |a (DE-599)BVBBV019409403 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 |a DE-188 | ||
| 100 | 1 | |a Baum, Daniel |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Finding all maximal cliques of a family of induced subgraphs |c Daniel Baum |
| 264 | 1 | |a Berlin |b Konrad-Zuse-Zentrum für Informationstechnik |c 2003 | |
| 300 | |a 14 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a ZIB-Report |v 2003,53 | |
| 520 | 3 | |a Abstract: "Many real world problems can be mapped onto graphs and solved with well-established efficient algorithms studied in graph theory. One such problem is the following: given a set of objects and an irreflexive and symmetric relation between these objects, find maximal subsets whose elements mutually satisfy this relation. This problem can be transformed to the problem of finding all cliques of an undirected graph by mapping each object onto a vertex of the graph and connecting any two vertices by an edge whose corresponding objects satisfy the given relation. In this paper we study a related problem, where all objects have a set of binary attributes, each of which is either 0 or 1. We want to find maximal subsets of objects not only mutually satisfying a given relation; but, in addition, all objects of a subset also need to have at least one common attribute with value 1. This problem can be mapped onto a set of induced subgraphs, where each subgraph represents a single attribute. For attribute i, its associated subgraph contains those vertices corresponding to the objects with attribute i set to 1. We introduce the notion of a maximal clique of a family, G, of induced subgraphs of an undirected graph, and show that determining all maximal cliques of G solves our problem. Furthermore, we present an efficient algorithm to compute all maximal cliques of G. The algorithm we propose is an extension of the widely used Bron-Kerbosch algorithm [6]." | |
| 650 | 4 | |a Branch and bound algorithms | |
| 650 | 4 | |a Graph theory | |
| 830 | 0 | |a ZIB-Report |v 2003,53 |w (DE-604)BV013191727 |9 2003,53 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-012871418 | |
Datensatz im Suchindex
| _version_ | 1820882437353242624 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Baum, Daniel |
| author_facet | Baum, Daniel |
| author_role | aut |
| author_sort | Baum, Daniel |
| author_variant | d b db |
| building | Verbundindex |
| bvnumber | BV019409403 |
| classification_rvk | SS 4779 |
| ctrlnum | (OCoLC)57072777 (DE-599)BVBBV019409403 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV019409403</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20060111</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">041001s2003 xx d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)57072777</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV019409403</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">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Baum, Daniel</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Finding all maximal cliques of a family of induced subgraphs</subfield><subfield code="c">Daniel Baum</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Konrad-Zuse-Zentrum für Informationstechnik</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">14 S.</subfield><subfield code="b">graph. Darst.</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">ZIB-Report</subfield><subfield code="v">2003,53</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Many real world problems can be mapped onto graphs and solved with well-established efficient algorithms studied in graph theory. One such problem is the following: given a set of objects and an irreflexive and symmetric relation between these objects, find maximal subsets whose elements mutually satisfy this relation. This problem can be transformed to the problem of finding all cliques of an undirected graph by mapping each object onto a vertex of the graph and connecting any two vertices by an edge whose corresponding objects satisfy the given relation. In this paper we study a related problem, where all objects have a set of binary attributes, each of which is either 0 or 1. We want to find maximal subsets of objects not only mutually satisfying a given relation; but, in addition, all objects of a subset also need to have at least one common attribute with value 1. This problem can be mapped onto a set of induced subgraphs, where each subgraph represents a single attribute. For attribute i, its associated subgraph contains those vertices corresponding to the objects with attribute i set to 1. We introduce the notion of a maximal clique of a family, G, of induced subgraphs of an undirected graph, and show that determining all maximal cliques of G solves our problem. Furthermore, we present an efficient algorithm to compute all maximal cliques of G. The algorithm we propose is an extension of the widely used Bron-Kerbosch algorithm [6]."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Branch and bound algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">ZIB-Report</subfield><subfield code="v">2003,53</subfield><subfield code="w">(DE-604)BV013191727</subfield><subfield code="9">2003,53</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-012871418</subfield></datafield></record></collection> |
| id | DE-604.BV019409403 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T17:06:53Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-012871418 |
| oclc_num | 57072777 |
| open_access_boolean | |
| owner | DE-703 DE-188 |
| owner_facet | DE-703 DE-188 |
| physical | 14 S. graph. Darst. |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Konrad-Zuse-Zentrum für Informationstechnik |
| record_format | marc |
| series | ZIB-Report |
| series2 | ZIB-Report |
| spelling | Baum, Daniel Verfasser aut Finding all maximal cliques of a family of induced subgraphs Daniel Baum Berlin Konrad-Zuse-Zentrum für Informationstechnik 2003 14 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier ZIB-Report 2003,53 Abstract: "Many real world problems can be mapped onto graphs and solved with well-established efficient algorithms studied in graph theory. One such problem is the following: given a set of objects and an irreflexive and symmetric relation between these objects, find maximal subsets whose elements mutually satisfy this relation. This problem can be transformed to the problem of finding all cliques of an undirected graph by mapping each object onto a vertex of the graph and connecting any two vertices by an edge whose corresponding objects satisfy the given relation. In this paper we study a related problem, where all objects have a set of binary attributes, each of which is either 0 or 1. We want to find maximal subsets of objects not only mutually satisfying a given relation; but, in addition, all objects of a subset also need to have at least one common attribute with value 1. This problem can be mapped onto a set of induced subgraphs, where each subgraph represents a single attribute. For attribute i, its associated subgraph contains those vertices corresponding to the objects with attribute i set to 1. We introduce the notion of a maximal clique of a family, G, of induced subgraphs of an undirected graph, and show that determining all maximal cliques of G solves our problem. Furthermore, we present an efficient algorithm to compute all maximal cliques of G. The algorithm we propose is an extension of the widely used Bron-Kerbosch algorithm [6]." Branch and bound algorithms Graph theory ZIB-Report 2003,53 (DE-604)BV013191727 2003,53 |
| spellingShingle | Baum, Daniel Finding all maximal cliques of a family of induced subgraphs ZIB-Report Branch and bound algorithms Graph theory |
| title | Finding all maximal cliques of a family of induced subgraphs |
| title_auth | Finding all maximal cliques of a family of induced subgraphs |
| title_exact_search | Finding all maximal cliques of a family of induced subgraphs |
| title_full | Finding all maximal cliques of a family of induced subgraphs Daniel Baum |
| title_fullStr | Finding all maximal cliques of a family of induced subgraphs Daniel Baum |
| title_full_unstemmed | Finding all maximal cliques of a family of induced subgraphs Daniel Baum |
| title_short | Finding all maximal cliques of a family of induced subgraphs |
| title_sort | finding all maximal cliques of a family of induced subgraphs |
| topic | Branch and bound algorithms Graph theory |
| topic_facet | Branch and bound algorithms Graph theory |
| volume_link | (DE-604)BV013191727 |
| work_keys_str_mv | AT baumdaniel findingallmaximalcliquesofafamilyofinducedsubgraphs |