Download
1 / 12
120 likes | 123 Vues
3 3 6 4 8 8 a e c 5 4 6 3 3 AN pTree Ct. More Complex Graph Structures? The vertex-labelled, edge-labelled graph. AN 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 TS. 1 1 0 1 0 0 0 0
E N D
3 3 6 4 8 8 a e c 5 4 6 3 3 AN pTree Ct More Complex Graph Structures? The vertex-labelled, edge-labelled graph AN 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 1 2 3 4 5 6 7 8 9 10 11 12 13 14 TS 1 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 0 1 0 0 0 0 0 0 0 0 0 1 1 1 1 0 1 1 1 0 0 0 0 0 1 0 0 0 0 0 1 1 1 1 0 1 0 1 1 0 0 1 1 1 0 0 0 1 1 1 1 0 1 1 1 1 1 1 1 1 0 1 1 0 0 1 0 1 0 0 0 0 1 1 1 1 1 1 1 0 1 1 1 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 1 1 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 We can interpret this structure many ways, 1. as a relationship with entity tables; 2. as a AN[lysist] Table with attributes, the AN attributes (SA, Ct, C, Sal) plus each TickerSymbol pTree as an additional attribute (the TS attributes (Dow?,Ct,BHS,SA) are not captured in this interpretation); 3. as a T[icker] S[ymbol] or Stock Table with attributes, the TS attributes (Dow?, Ct, BHS, SA) plus each Analyst pTree as an additional attribute (the AN attributes (SA, Ct, F, Sal) are not captured in this interpretation); 1 0 0 1 1 1 1 0 1 0 0 1 1 0 Dow? ANalystTickerSymbolRelationship with labels H B B SB B SS S S H H B B B SB Buy-Hold-Sell 1 3 1 3 3 1 2 3 1 1 2 2 3 3 TS SA TS pTree Ct 8 7 8 7 4 4 4 3 4 4 4 6 7 8 5 2 2 2 AN SA 3 3 2 1 3 2 3 1 3 2 2 1 1 1 3 1 2 3 Sal 7 5 7 6 2 1 6 4 5 7 4 5 6 3 4 1 6 1 C 2 3 0 1 0 1 0 0 0 0 0 0 2 0 0 0 0 3 In full pTree form: 1 0 0 1 1 1 1 0 1 0 0 1 1 0 Dow? 0 0 0 0 1 1 1 1 1 0 0 0 0 0 C3 0 0 1 1 0 0 0 1 1 1 1 1 0 0 C2 1 1 1 0 0 0 1 1 0 0 0 1 1 1 C1 1 1 0 0 0 0 0 0 0 1 0 0 1 1 C0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 SS 0 0 0 0 0 0 1 1 0 0 0 0 0 0 S 1 0 0 0 0 0 0 0 1 1 0 0 0 0 H 0 1 1 0 1 0 0 0 0 0 1 1 1 0 B We can include this relationship with other relationships sharing entities by using the RoloDex Model (next slide). 0 0 0 1 0 0 0 0 0 0 0 0 0 1 SB 0 1 0 1 1 0 1 1 0 0 1 1 1 1 SA1 1 1 1 1 1 1 0 0 1 1 0 0 0 1 SA0 S A 1 1 1 0 1 1 0 1 1 1 0 0 1 1 1 1 1 0 1 S A 0 0 1 0 1 0 0 0 0 0 0 0 0 1 0 1 0 0 0 C 3 1 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 C 2 0 1 0 1 1 1 1 0 1 1 1 1 1 0 1 0 0 0 C 1 0 1 0 1 0 0 0 1 0 0 0 1 1 0 0 1 1 1 C 0 0 1 0 1 0 0 0 0 0 0 0 0 1 0 1 0 0 0 S 2 1 1 1 1 0 0 1 1 1 1 1 1 1 0 1 0 1 0 S 1 1 0 1 1 1 0 1 0 0 1 0 0 1 1 0 0 1 0 F 1 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 AN 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 S 0 1 1 1 0 0 1 0 0 1 1 0 1 0 0 0 1 0 1 1 2 3 4 5 6 7 8 9 10 11 12 13 14 TS The graph could be 3D, 4D (i.e., edges are triples, quadruples), etc. 2 1 0 2 0 2 2 0 0 0 0 0 0 0 0 0 0 0 3 3 2 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 3 3 2 2 3 0 0 0 0 0 0 0 0 0 0 0 0 3 1 3 3 3 1 0 0 0 0 0 0 0 0 0 0 0 0 2 2 2 2 2 2 2 0 2 0 0 0 0 0 0 0 0 0 1 1 1 1 0 1 1 1 0 0 0 0 0 1 0 0 0 0 1 3 3 3 2 1 1 1 0 0 0 0 0 2 0 0 0 1 2 2 2 1 0 2 1 2 1 2 2 2 1 0 2 2 0 0 2 1 3 1 0 0 0 2 2 2 1 2 1 2 0 1 3 3 2 2 1 2 2 0 0 0 1 2 3 3 3 3 3 1 2 1 0 0 0 0 0 0 0 0 0 0 0 0 0 2 1 0 2 1 0 0 0 0 0 1 1 1 2 3 3 3 3 3 3 1 1 1 0 0 0 0 0 0 0 0 0 0 0 2 2 2 0 0 0 0 0 0 0 0 0 1 1 2 1 2 1 3 3 3 1 1 1 1 10 01 00 10 01 01 01 00 00 00 00 00 00 00 00 00 00 00 11 11 10 01 00 00 00 00 00 00 00 00 00 00 00 00 00 00 10 11 11 10 10 11 00 00 00 00 00 00 00 00 00 00 00 00 11 01 11 11 11 01 00 00 00 00 00 00 00 00 00 00 00 00 10 10 10 10 10 10 10 00 10 00 00 00 00 00 00 00 00 00 01 01 01 01 00 01 01 01 00 00 00 00 00 10 00 00 00 01 01 11 11 11 10 01 10 01 10 10 00 00 01 01 01 01 01 01 10 10 10 01 00 10 01 10 01 10 10 10 01 00 10 10 00 00 10 01 11 01 00 00 00 10 10 10 01 10 01 10 00 01 11 11 10 10 01 10 10 00 00 00 01 10 11 11 11 11 11 01 10 01 00 00 00 00 00 00 00 00 00 00 00 00 00 10 01 00 10 01 00 00 00 00 00 01 01 01 10 11 11 11 11 11 11 01 01 01 00 00 00 00 00 00 00 00 00 00 00 10 10 10 00 00 00 00 00 00 00 00 00 01 01 10 01 10 01 11 11 11 01 01 01 01 The graph could also be edge labelled. A convenient way to capture edge labels is by making the cell content of each matrix cell into the label structure rather than just a yes/no bit. As a simple but pertinent example, suppose we have a 0-3 rating of each Analyst-Stock pair which measure how much that Analysts know about that stock. We just change each bit to a decimal number in [0,3] (or bitslice those using two bits instead of on, so that the matrix columns are 2-bit pTreeSets rather than just one pTree). If C measures the “Correctness Level” of the Analyst over recent days or weeks over all stock (e.g., based on backward analysis of previous sentiment analysis and the actual performance of the stock) and the cell numbers measure the correctness of that Analyst on that Stock, then a signal might be to mask C>=2 and for those Analysts find the average Correctness for each stock, then mask out those Stock for which the number of Analysts is between two thresholds (want a high average but also more than one analyst but not too many).
Every Entity (Gene, Term, Experiment, Person, Document, Item, Stock, Course, Movie) has an EntityTable of many descriptive attributes (columns). They aren’t shown here. For example, on the previous slide we show the descriptive columns of Stocks(Dow?, Count, BHS, SA) and Analysts(SA,Count,Female?,SalaryInBillions), not shown here. 16 6 itemset itemset 5 Item 4 3 2 1 Author People 1 2 1 2 2 3 2 3 3 3 4 4 4 5 5 4 5 6 7 ItemSet ItemSet antecedent Customer 1 1 1 1 1 1 1 1 5 6 16 1 1 1 2 1 1 1 1 Enroll 1 1 1 3 Doc 1 4 movie 2 Course 3 term G 3 0 0 0 5 0 4 0 5 0 0 0 1 0 1 2 3 4 5 6 7 Doc 0 0 3 0 0 customer rates movie 0 2 2 0 3 4 0 0 0 0 1 0 0 1 0 0 4 0 0 5 0 t Stock 3 2 1 1 1 2 2 3 3 PI PI ShareStem termterm rel CellLabel=stem Gene 4 4 5 5 6 6 7 7 1 1 3 Exp 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 customer rates movie as 5 relationships 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 In looking for signals that no one else uses: What if an Investor BUYS an island in the Mediterranean? What if an Investor’s best friend buys lots of stock in an Online University? Tweets are Documents, so the Tweet-Tweeter relationship is a Document-Author relationship (Tweetee, hashtag, etc. are Edge Labels). Stock-Investor relationship Conf(AB) =Supp(AB)/Supp(A) Supp(A) = CusFreq(ItemSet) Friends relationship BUYS TermDocument AuthDoc genegene rel (ppi) docdoc People Expgene expPI The Multi-Relationship Model
More Complex Graph Structures? HyperGraphs, cliqueTrees (cTrees), Motifs BiPART Clique Mining finds MaxCliques at cost of pairwise &s. Each LETpTreeMCLQ unless pairwise & with same count.A&B, B w Ct(A&B)=Ct(A) is a MCLQ. potential for a k-plex [k-core] mining alg here. Instead of Ct(A&B)=Ct(A), consider. E.g., Ct(A&B)=Ct(A)-1. Each such pTree, C, would be missing just 1vertex (1 edge). Taking any MCLQ as above, ANDing in CpTree would produce a 1-plex. ANDing in k such C’s would produce a k-plex. In fact, suppose we have produced a k-plex in such a manner, then ANDing in any C with Ct(C)=Ct(A)-h would produce a (K+h)-plex. &i=1..nAi is a [i=1..nCt(Ai)]-Core TriPART Clique Mining Algorithm? In a Tripartite Graph edges must start and end in different vertex parts. E.g., PART1=tweeters; PART2=hashtags; PART3=tweets. Tweeters-to-hashtags is many-to-many? Tweeters-to-tweets is many-to-many (incl. retweets)?; hashtags-to-tweets is many-to-many? MultiPART Graphs BiPART, TriPART (have 2,3 PARTs respectively but still an edge is a linear (between two vertices) … No edge can start and end in the same PART. D I S Cts 0 1 1 0 1 1 1 1 0 2 2 2 HyperCliqueMining: A 3hyperGraph has 3 vertex PARTS and each edge is a planar triangle (defined by a vertex triple, one from each PART). Stock recommender is 3hyperGraph (Investors, Stocks, Days). A triangular edge connects Investor k, Stock X, and Day n if k recommends X on day n. A 3hyperClique is a community s.t. all investors in clique recommend all stocks in the clique on each day in clique. Tweet ex: PART1=tweeters; PART2=hashtags; PART3=tweets. Conjecture: KmultiCliques and KhyperCliques are in 1-1 correspondence (both are defined by a K PART vertex set)? So, only one mining process needed? We will represent these common objects with cliqueTrees (cTrees). A cTree bitmaps each PART of the clique. E.g., the cTree for Inv={2,3}; Stock={A,B} Day={,}: GRAPH (linear edges, 2 vertices) kHyperGraph (edges=k vertices) Cliques, Kplexes and Kcores are subgraphs (communities) defined using an internal edge count. A Motif is a subgraph defined using external “isomorphism into the graph” count. A motif must occur (isomorphically) in the graph more times than “expected”. Criticism: Some authors argue[62] that a motif structure does not necessarily determine function. Recent research[64] shows the connections of a motif to the network, is too important to draw function inferences just from local structure.[65] Research shows certain topological features of biological networks naturally give rise to canonical motifs,.[66] kPART HyperGraph (V=!Vii=1..k (x1..xk)E xj,xjsame Vi ) kPARTITE Graph or just kPART Graph (V=!Vii=1..k (x,y)Ex,ysame Vi ) Most find induced Motifs. A graph, G′, is a subgraph of G (G′⊆G) if V′⊆V and E′⊆E∩(V′×V′). If G′⊆G and G′ contains all ‹u,v›∈E with u,v∈V′, G′ is induced sub-graph. G′ and G are isomorphic (G′↔G), if a bijection f:V′→V with ‹u,v›∈E′⇔‹f(u),f(v)›∈E u,v∈V′. G″⊂G and an isomorphism between G″ and G′, G′ appears in G). The number of appearances G′ in G is the frequency FG of G′ in G, FG(G’). G is recurrent or frequent in G, when FG(G’)>threshold (pattern=frequent subgraph). Motif discovery includes exact counting, sampling, pattern growth. Motif discovery has 2 steps: calculate the # of occurrences; evaluating the significance. Are Stock-Inv or Stock-Inv-Day Motifs useful? Some questions/theorems/thoughts: • All K-Paths are isomorphic (thus, there’s alway a Kpath motif). • A ShortestKPath is an Induced subgraph. • What does sequence Frequency(1PathMotif)=|V|, Frequency(2PathMotif),…tell? • Sequence of Frequency(Shortest1Path), Frequency(Shortest2Path), …? • Sequence Frequency(MaxShortest1Path), Frequency(MaxShortest2Path)… tell us? where a MaxS2P is not part of a S3P. • Extend to HyperEdges? What is a path in, e.g., a 3HyperGraph? Both? 2HGInterface3HyperGraphPath. 1HGI3HGP. (In general, hHGIkHGP, where 0<h<k) At the other extreme (all SPs are length=1: • I’ll bet most important motifs, M(V’,E’) in G are “Shortest Path Motifs”: x,yV’, a G-ShortestPath in M running from x to y. I.e., M is made up of G-SPs. • A Clique is a SPMotif (made up entirely of Shortest1Paths) Or? A 4PARThyperGraph or just 4HyperGraph has 4 vertex PARTS and each edge is a solid tetrahedron (defined by a vertex quadruple, one from each PART). Stock Recommender 4hyperGraph (Investors, Stocks, Strengh(StronBuy,…), Days). A tetrahedral "edge" connects Investor k, Stock X, Strength B and Day n iff k recommends X as a Buy on day n. A 4hyperClique is a community s.t. all the investors recommend all the stocks as strength=B on each day in the clique. some degeneracy since the Strength will always be singleton? One might argue that this is just a series of 3HyperGraphs, one for each strength level.) A Tweet 4HyperGraph: PART1=tweeters; PART2=hashtags; PART3=tweets, PART4=day. A 4hyperClique: all tweeters send all tweets on all hashtags each day of the clique. A MBR 4HyperGraph: PART1=customers; PART2=items; PART3=days, PART4=store. A 4hyperClique: all customers buy all items at all stores on each day of the clique.
Introduction to 2PART Graph Community Search: For a multipartite graph the concept of community is still related to a large density of edges between members of the same group. A clique in a 2PART (bipartite) graph to be a bipartite subset of vertices with all possible edges. 2PART Induction thm: In a bipartite graph, a Kclique and 3clique that share an edge form a (K+1)clique iff all edges that can exist, from the non-shared Kclique vertices to the non-shared 3clique vertex, do exist. 2PART 3Clique thm: a pair of vertices from part1, a,b and a vertex from the part2, 1, form a 3Clique iff both possible edges a1, b1 exist. CLQ3 is constructed by listing each vertex pair in each pTree along with the naming vertex of the pTree. a a 1 1 b The 2 3cliques ab1 and b12 sharing b1 form a 4clique iff the non-shared vertex pair a2 is an edge The 2 3cliques ab1 and bc1 sharing b1 form a 4clique. b c 2 a 1 b c d a 1 a a b 1 1 b b c 2 2 5clique abc12 and 3clique c23 sharing c2 form a 6clique iff the non-shared vertex pairs a3and b3 are edges. 5clique abc12 and 3clique d12 sharing vertices 1 and 2 form a 6clique. 5clique abcd1 and 3clique de1 sharing edge e1 form a 6clique. c c d 3 d e a a 1 a 1 b a b 1 1 6clique abc123 and 3clique cd3 sharing c3 form a 7clique iff the non-shared vertex pairs d1 and d2 are edges. 6clique abc123 and 3clique d23 sharing vertices 2 and 3 form a 7clique iff vertex pair d1 is an edge. 6clique abcd12 and 3clique de2 sharing edge d2 form a 7clique iff vertex pair e1 is an edge 6clique abcde1 and 3clique ef1 sharing edge e1 form a 7clique. b 2 c b 2 c 2 c d c 3 d 3 d e d e f a 1 b 2 The 4clique ab12 and 3clique bc2 sharing b2 form a 5clique iff the non-shared vertex pair c1 is an edge. The 4clique abc1 and 3clique cd1 sharing c1form a 5clique c Although the pattern seems complex, the 2PART Clique Algorithm can be stated: A Kclique and 3clique sharing 2 vertices form a K+1clique iff all edges from the non-shared 3clique vertex to each non-shared Kclique vertex (from the other PART) exist. That is, check edge existence between all non-shared vertices.
2PART G11: Inv(12345) rec Stock(ABCDE) cliqueTrees NPZpTrst=5 L=2 L=1 L=0 G11 Stock EBCTs I S 1 A 1 1 1 1 1 1 1 2 3 4 5 0 0 0 0 1 0 1 1 1 0 1 3 0 0 1 1 1 0 1 1 1 0 3 3 1 1 0 0 0 1 1 1 1 0 2 4 0 1 0 0 0 1 1 1 1 1 1 5 0 1 1 1 0 0 0 1 1 1 3 3 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 1 2 3 4 5 A A A A A B B B B B C C C C C D D D D D E E E E E 1 1 0 1 0 1 1 0 0 0 1 1 1 1 0 1 1 1 1 0 0 1 1 1 0 1 1 0 1 0 1 0 1 1 0 3 3 1 1 1 1 0 0 0 1 1 0 4 2 0 1 0 1 0 1 0 1 1 1 2 4 2 B New DSs: Traditional data structures 3 C EdgeTbl A B C D E Stock EBCTs I S Investor BCTs S I Stock BCTs I S 1 1 1 1 2 2 2 2 2 3 3 3 4 4 4 4 Inv EBGTs 4 D A B C D A B C D E C D E A C D E A B C D E A B C D E 1 2 3 4 5 1 2 3 4 5 1 0 0 0 0 1 1 0 1 0 1 3 1 0 1 1 0 1 1 0 1 0 3 3 1 1 0 0 0 1 1 1 1 0 2 4 1 0 0 0 0 1 1 1 1 0 1 4 0 1 0 0 0 1 1 1 1 1 1 5 1 1 1 1 0 1 1 0 0 0 4 2 0 1 0 0 0 1 1 0 0 0 1 2 0 1 0 0 0 1 1 1 1 1 1 5 0 0 1 1 0 1 1 1 1 0 2 4 0 0 1 0 0 0 0 1 1 1 1 3 0 1 1 1 0 0 0 1 1 1 3 3 0 0 1 0 0 1 1 1 1 0 1 4 0 0 0 1 0 1 0 1 1 1 1 4 0 1 0 1 0 1 0 1 1 1 2 4 0 0 0 1 0 1 1 1 1 0 1 4 0 1 1 1 0 3 1 1 0 1 0 3 1 1 1 1 0 4 1 1 0 0 0 2 1 1 1 1 0 4 5 E oa 0 1 0 1 0 1 1 0 0 0 1 1 1 1 0 Graph G11 oa A B C D E A B C D E 1 2 3 4 5 1 2 3 4 5 1 1 0 0 0 1 1 1 1 0 =C a MaxClique.Then 1 of must be a BC, say Expanding it must give C. Thus, for Tripartite Graphs, every MaxClique is an EBCT =C a MaxClique.Then 1 of must be a BC, say Expanding it gives C. Thus, for Bipartite Graphs, every MaxClique is an EBCT. 1 1 1 1 1 0 2 1 1 1 1 1 3 0 0 1 1 1 4 1 0 1 1 1 5 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 1 1 1 1 0 0 1 0 0 0 1 0 0 0 0 1 1 1 1 0 1 0 0 0 0 1 1 1 1 0 0 1 0 0 0 1 0 0 0 0 1 1 1 1 0 0 1 0 0 0 1 1 1 1 0 1 0 0 0 0 1 1 1 1 0 A B C D E Adj Matrix 1 1 1 1 1 2 2 2 2 2 3 3 3 3 3 4 4 4 4 4 5 5 5 5 5 A B C D E A B C D E A B C D E A B C D E A B C D E 1 1 1 1 0 1 1 1 1 1 0 0 1 1 1 1 0 1 1 1 0 0 0 0 0 1 0 1 0 1 1 0 0 1 2 2 1 1 1 1 1 0 0 1 0 0 3 1 1 DI StockBaseCliqueTrees D I S 3PART HyperGraph H1: On Days() Investors(123) recommend Stocks(ABC) 1 1 1 2 2 2 3 3 3 1 1 1 2 2 2 3 3 3 1 1 1 2 2 2 3 3 3 A B C A B C A B C A B C A B C A B C A B C A B C A B C 1 0 1 1 1 1 0 0 1 1 0 0 0 1 1 1 1 0 1 0 0 1 1 1 1 0 1 It is not true that 1 must be a BC, since there could be a different expansion for each of those 4, intersecting in C. In that case, we get each of those different expansions as an EBCT, but then the other operator will give us C (we will AND those expansions yielding the core leaf but OR the singletons giving the correct Part of C. DIS NPZ pTree Stride=3 L=2 L=1 L=0 (It’s hard to draw a HyperGraph – will try on next slide) 1 0 0 1 1 0 1 0 1 1 2 2 1 0 0 1 0 0 1 0 1 1 1 2 1 0 0 1 0 0 1 0 1 1 1 2 1 0 0 1 0 0 1 0 1 1 1 2 1 0 0 1 1 0 1 0 1 1 2 2 1 0 0 1 1 0 1 0 1 1 2 2 1 0 0 1 1 0 1 0 1 1 2 2 1 0 1 0 1 0 1 1 1 2 1 3 1 0 0 0 1 0 1 1 1 1 1 3 1 0 0 0 1 0 1 1 1 1 1 3 1 0 1 0 1 0 1 1 1 2 1 3 1 0 1 0 1 0 1 1 1 2 1 3 1 0 1 0 1 0 1 1 1 2 1 3 1 0 0 0 1 0 1 1 1 1 1 3 1 0 1 0 1 1 0 0 1 2 2 1 1 0 0 1 1 1 0 0 1 1 3 1 1 0 0 0 0 1 0 0 1 1 1 1 1 0 0 1 1 1 0 0 1 1 3 1 1 0 0 1 1 1 0 0 1 1 3 1 1 0 1 0 0 1 0 0 1 2 1 1 1 0 0 0 0 1 0 0 1 1 1 1 1 1 1 1 0 0 1 0 0 3 1 1 0 1 0 1 0 0 1 0 0 1 1 1 0 1 1 1 0 1 1 0 0 2 2 1 0 1 1 1 0 1 1 0 0 2 2 1 0 1 0 1 0 1 1 0 0 1 2 1 0 1 0 1 0 0 1 0 0 1 1 1 1 1 1 1 0 0 1 0 0 3 1 1 1 1 1 0 1 0 0 1 1 3 1 2 1 1 1 0 1 0 0 1 1 3 1 2 1 1 1 0 1 0 0 1 1 3 1 2 0 1 0 0 1 0 0 1 1 1 1 2 0 1 0 0 1 0 0 1 1 1 1 2 1 1 1 0 1 0 0 1 1 3 1 2 0 1 0 0 1 0 0 1 1 1 1 2 0 1 0 0 0 1 1 1 0 1 1 2 0 1 0 0 0 1 1 1 0 1 1 2 0 1 0 0 0 1 1 1 0 1 1 2 0 1 0 0 0 1 1 1 0 1 1 2 0 1 0 0 0 1 1 1 0 1 1 2 0 1 0 0 0 1 1 1 0 1 1 2 0 1 0 0 0 1 1 1 0 1 1 2 0 0 1 1 0 0 1 0 0 1 1 1 0 0 1 1 0 0 1 0 0 1 1 1 0 0 1 1 1 1 1 0 0 1 3 1 0 0 1 1 1 1 1 0 0 1 3 1 0 0 1 1 1 1 1 0 0 1 3 1 1 0 1 0 1 0 1 1 1 2 1 3 0 0 1 0 1 0 1 1 1 1 1 3 1 0 1 0 1 0 1 1 1 2 1 3 0 0 1 0 1 0 1 1 1 1 1 3 0 0 1 0 1 0 1 1 1 1 1 3 0 0 1 0 0 1 1 0 1 1 1 2 0 0 1 0 1 1 1 0 1 1 2 2 0 0 1 0 1 1 1 0 1 1 2 2 0 0 1 0 0 1 1 0 1 1 1 2 0 0 1 0 0 1 1 0 1 1 1 2 0 0 1 0 1 1 1 0 1 1 2 2 0 0 1 0 1 1 1 0 1 1 2 2 1 1 1 0 0 0 1 0 1 0 0 0 0 1 1 1 1 0 0 0 0 1 0 0 1 0 0 0 1 1 1 1 0 EdgeMap 1 2 3 1 2 3 DI StockBaseCliqueTrees D I S 1 2 3 1 2 3 1 1 1 1 1 1 1 1 1 A B C A B C A B C A B C 1 0 1 1 1 1 0 0 1 1 0 0 0 1 1 1 1 0 1 0 0 1 1 1 1 0 1 aoa oaa Thm: Every Maximal Clique is an Expanded Base Clique. I.e., C is a Maximal Clique iff C is an Expanded Base Clique I.e., MC(G)=EBC(G). Pf: Let be any MaxClique, C. Then some leaf expansion of each of … is a BCT. After we apply a..aoa..a with o in each but the last position, we will have an EBCT with the upper Parts of C and a leaf that covers the leaf of C. However, the leaf of that EBCT cannot strictly cover the leaf of C lest it be a MaxClique that strictly covers C. Thus, that EBCT=C H1 Stock EBCTs 1 2 3 1 2 3 aoa oaa A B C A B C NPZpTst=5 L=2 L=1 L=0 1 1 1 1 1 0 0 1 0 0 0 1 0 0 0 0 . . . 1 1 1 1 0 0 1 0 0 0 0 1 0 0 0 . . . 1 1 1 1 0 0 0 0 1 0 1 0 0 0 0 . . . 1 1 1 1 0 0 0 0 1 0 0 1 0 0 0 . . . 1 1 1 1 0 0 1 0 1 0 1 1 0 0 0 . . . 1 1 1 1 0 1 0 0 0 0 1 1 0 1 0 0 1 0 0 0 1 1 0 0 1 1 1 1 1 0 4 1 1 1 1 1 5 0 0 1 1 1 3 1 0 1 1 1 4 Proof is suspect because of this example: Even tho is a MaxClique, we don’t get it as a EBCT because neither leaf covers the other. The stmt that is not true is the underlined. 1 2 3 1 1 0 0 0 1 1 0 0 0 A B C
3PART HyperGraph H2: On Days() Investors(12) recommend Stocks(AB) BasecliqueTrees (BcTs), ExpandedBase cTrees (EBcTs)=MaxCliques for: DSI Base cTrees ISD BcTs SDI BcTs SID CBcTs SID CBcTs SDI Base cTrees DSI Base cTrees DSI Base cTrees SID Base cTrees ISD BcTrees SDI Base cTrees DSI Base cTrees SDI Base cTrees DSI Base cTrees DSI Base cTrees ISD BcTrees ISD BcTrees DSI Base cTrees DSI Base cTrees SID Base cTrees SID Base cTrees 1 2 1 2 1 2 1 2 1 2 1 2 0 1 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 0 1 1 2 1 1 0 0 1 1 0 1 1 1 1 1 1 0 0 1 2 1 1 1 0 1 1 0 1 1 2 1 1 0 0 1 1 0 1 1 1 1 0 0 1 0 1 1 1 1 1 0 0 1 0 1 1 1 1 1 0 0 1 0 1 1 1 1 1 0 0 1 0 1 1 1 1 0 1 1 0 0 1 0 1 1 0 0 1 1 1 1 0 1 1 0 0 1 1 1 1 0 1 1 0 0 1 1 1 1 0 1 1 0 0 1 1 1 1 0 1 1 0 0 1 1 1 1 0 1 1 0 0 1 1 1 1 0 1 1 0 0 1 1 1 1 0 1 1 0 0 1 1 1 1 A B A B A B A B A B A B A B 1 0 0 1 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 0 1 1 0 1 0 0 1 1 0 1 1 1 0 1 1 0 1 0 1 1 1 0 1 1 0 1 0 1 1 1 0 1 1 0 1 0 1 1 1 0 1 1 0 1 0 1 1 1 0 1 1 0 1 1 1 1 2 0 1 1 0 1 1 1 1 2 0 1 1 0 1 0 1 1 1 0 1 1 0 1 0 1 1 1 0 1 1 0 1 0 1 1 1 0 1 1 0 1 0 1 1 1 0 1 1 0 1 0 1 1 1 0 1 1 0 1 0 1 1 1 0 1 1 0 1 0 1 1 1 1 0 1 0 0 1 1 1 1 1 0 0 1 1 0 1 0 1 0 0 1 1 1 1 1 0 1 0 0 1 1 0 1 0 0 1 1 1 1 1 0 0 1 0 1 0 1 1 0 1 0 0 1 1 0 1 0 1 0 0 1 1 0 1 0 1 0 0 1 0 1 1 0 1 0 1 0 0 1 1 0 1 0 1 0 0 1 0 1 1 0 0 1 0 1 0 1 1 0 1 0 0 1 0 1 0 1 1 0 0 1 0 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 1 0 1 0 1 0 0 1 0 1 1 0 1 0 1 0 0 1 1 0 1 0 1 0 0 1 0 1 1 0 1 0 1 2 1 2 1 2 A B A B A B A B A B A B A B A B A B A B A B A B A B A B 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 DIS NPZ pTree Stride=2 L=2 L=1 L=0 aoa oaa oaa aoa oaa aoa aoa aoa aoa aoa 1 1 1 0 1 1 ISD NPZ pTree Stride=2 SDI NPZ pTree Stride=2 IDS NPZ pTree Stride=2 A B 1 2 A B 1 2 0 1 1 0 1 0 1 1 1 1 1 1 DIS BcTs DIS Base cTrees D I S IDS Base cTrees 1 1 0 1 1 1 0 1 0 1 1 0 oaa oaa oaa 1 2 A B 1 2 A B MaxCliques(H2)= 1 BcTs + 1 EBcT 0 1 0 1 1 0 1 1 1 0 0 1 1 0 1 0 0 1 1 1 1 0 2 1 1 1 1 1 1 2 2 2 2 1 1 1 1 2 2 2 2 A A A A B B B B 1 1 2 2 1 1 2 2 A A B B A A B B A A A A B B B B A B A B A B A B A A B B A A B B 1 2 1 2 1 2 1 2 A B A B A B A B 1 1 2 2 1 1 2 2 1 2 1 2 1 2 1 2 0 1 0 0 1 0 1 0 0 1 1 0 0 1 0 0 0 0 1 1 1 0 0 0 0 1 1 0 0 0 1 0 0 1 0 1 1 0 0 0 0 0 1 0 1 1 0 0 1 0 1 0 0 1 1 1 1 1 2 1 2 1 2 1 0 1 0 0 1 1 1 1 1 0 1 0 0 1 1 1 1 1 0 1 0 0 1 1 1 1 1 0 1 0 0 1 1 1 1 1 0 1 0 0 1 1 0 1 0 0 1 1 1 1 1 0 0 1 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 1 0 1 1 0 2 1 1 0 1 1 0 1 0 0 1 0 1 1 0 0 1 0 1 1 0 1 1 1 0 1 0 1 1 0 1 1 1 0 1 1 1 1 0 1 2 1 0 1 1 0 1 0 1 1 1 0 1 1 1 1 0 1 2 1 0 1 0 1 1 0 1 1 1 1 0 1 0 0 1 1 1 1 A B 1 2 A B 1 2 1 2 1 2 1 2 1 2 1 2 A B A B A B A B A B A B A B A B DSI NPZ pTree Stride=2 aao aao 1 1 The cTreeSet is closed under aao as well and applying aao to DSI and SDI gives the same 2 MaxClique cTrees SDI Base cTrees Seems to be no need to apply the 3 ops to 6 pTreeSets (apply aoa, oaa, aao to any 1 pTreeSet only). And if the 3 ops commute use any order). Can we concatenate pTreeSets into 1 and use only 1 op on it to get all EBcTs? If so, 1 op on 1 pTS gives EBcTs=MCLQs. 0 1 1 0 1 0 0 1 1 1 1 1 2 A B 0 1 1 0 1 0 1 1 1 1 0 1 1 The non-leaf cTree PARTs are a lexico ordering of singletons so construct the EBcTs using only the pTree Leaves? 1 2 Take oaa on one Concatenated BcT (CBcT), generate all EBcTs=MaxCliques! aao SID NPZ pTree Stride=2 1 1 1 1 1 0 0 1 0 1 1 0 oaa oaa
Maximal Base CliqueTrees for H3 Stock Day Investor Base cTrees A B C D E 1 0 0 0 0 1 0 1 1 1 1 1 0 1 0 1 4 3 1 0 0 0 0 0 1 1 0 0 1 1 1 0 0 1 2 3 1 1 1 1 1 0 0 1 0 0 1 1 1 1 0 5 1 4 1 1 1 1 0 1 0 1 1 0 1 1 0 0 0 4 3 2 1 1 1 1 1 0 1 1 0 0 0 1 1 0 0 5 2 2 0 1 0 0 0 0 0 1 0 0 1 1 1 1 1 1 1 5 1 1 1 1 1 0 0 1 1 0 1 1 0 1 0 5 2 3 1 1 0 0 1 0 0 1 1 1 1 0 0 1 0 3 3 2 0 0 1 1 0 1 0 1 0 0 1 1 1 1 0 2 2 4 0 0 1 1 1 1 1 1 0 0 0 1 1 0 0 3 3 2 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 3 3 3 1 0 1 0 0 1 0 1 1 1 1 1 0 0 0 2 4 2 0 0 1 1 0 1 0 1 0 0 1 1 1 1 0 2 2 4 0 0 0 1 0 1 1 1 1 1 0 1 0 0 0 1 5 1 0 0 1 1 1 1 0 1 0 0 0 1 1 1 0 3 2 3 1 0 0 0 1 0 0 1 1 1 1 1 0 1 0 2 3 3 1 0 0 0 0 1 0 1 1 1 1 1 0 1 0 1 4 3 1 0 0 0 0 0 1 1 0 0 1 1 1 0 0 1 2 3 1 0 0 0 0 0 0 1 0 0 1 1 1 1 0 1 1 4 0 1 0 0 0 1 0 1 1 0 1 1 0 0 0 1 3 2 0 1 0 0 0 0 1 1 0 0 0 1 1 0 0 1 2 2 0 1 0 0 0 0 0 1 0 0 1 1 1 1 1 1 1 5 0 1 0 0 0 0 0 1 1 0 1 1 0 1 0 1 2 3 0 1 0 0 0 0 0 1 1 1 1 0 0 1 0 1 3 2 0 0 1 0 0 1 0 1 0 0 1 1 1 1 0 1 2 4 0 0 1 0 0 1 1 1 0 0 0 1 1 0 0 1 3 2 0 0 1 0 0 1 0 1 1 0 1 1 0 1 0 1 3 3 0 0 1 0 0 1 0 1 1 1 1 1 0 0 0 1 4 2 0 0 0 1 0 1 0 1 0 0 1 1 1 1 0 1 2 4 0 0 0 1 0 1 1 1 0 0 0 1 1 0 0 1 3 2 0 0 0 1 0 1 0 1 1 0 1 1 0 1 0 1 3 3 0 0 0 1 0 1 1 1 1 1 0 1 0 0 0 1 5 1 0 0 0 0 1 1 0 1 0 0 0 1 1 1 0 1 2 3 0 0 0 0 1 1 1 1 0 0 0 1 1 0 0 1 3 2 0 0 0 0 1 0 0 1 0 0 1 1 1 1 0 1 1 4 0 0 0 0 1 0 0 1 1 1 1 1 0 1 0 1 3 3 1 0 0 0 0 1 0 0 0 0 1 1 0 1 0 1 1 3 1 0 0 0 0 0 1 0 0 0 1 1 1 0 0 1 1 3 1 0 0 0 0 0 0 1 0 0 1 1 1 1 0 1 1 4 1 0 0 0 0 0 0 0 1 0 1 1 0 1 0 1 1 3 1 0 0 0 0 0 0 0 0 1 1 1 0 1 0 1 1 3 0 1 0 0 0 1 0 0 0 0 1 1 0 0 0 1 1 2 0 1 0 0 0 0 1 0 0 0 0 1 1 0 0 1 1 2 0 1 0 0 0 0 0 1 0 0 1 1 1 1 1 1 1 5 0 1 0 0 0 0 0 0 1 0 1 1 0 1 0 1 1 3 0 1 0 0 0 0 0 0 0 1 1 0 0 1 0 1 1 2 0 0 1 0 0 1 0 0 0 0 1 1 1 1 0 1 1 4 0 0 1 0 0 0 1 0 0 0 0 1 1 0 0 1 1 2 0 0 1 0 0 0 0 1 0 0 1 1 1 1 0 1 1 4 0 0 1 0 0 0 0 0 1 0 1 1 0 1 0 1 1 3 0 0 1 0 0 0 0 0 0 1 1 1 0 0 0 1 1 2 0 0 0 1 0 1 0 0 0 0 1 1 1 1 0 1 1 4 0 0 0 1 0 0 1 0 0 0 0 1 1 0 0 1 1 2 0 0 0 1 0 0 0 1 0 0 1 1 1 1 0 1 1 4 0 0 0 1 0 0 0 0 1 0 1 1 0 1 0 1 1 3 0 0 0 1 0 0 0 0 0 1 0 1 0 0 0 1 1 1 0 0 0 0 1 1 0 0 0 0 0 1 1 1 0 1 1 3 0 0 0 0 1 0 1 0 0 0 0 1 1 0 0 1 1 2 0 0 0 0 1 0 0 1 0 0 1 1 1 1 0 1 1 4 0 0 0 0 1 0 0 0 1 0 1 1 0 1 0 1 1 3 0 0 0 0 1 0 0 0 0 1 1 1 0 1 0 1 1 3 1 2 3 4 5 CtI oaa (all of these will be Max Cliques) aoa We can count the S=1 D=1 I=4 motifs? 6 + COMBO(5,4)=5 = 11 113? 10+6C(4,3)+C(5,3) = 54 112? 7+10C3,2+6C4,2+C5,2 = 83 A B C D E Day Stock Investor Base cTrees 1 2 3 4 5 CtI 0 0 1 0 0 1 1 1 1 1 1 1 1 1 0 1 5 4 0 0 1 0 0 1 1 1 1 1 1 1 1 1 0 1 5 4 0 0 1 0 0 1 0 0 0 0 1 1 1 1 0 1 1 4 0 0 1 0 0 0 1 0 0 0 1 1 1 1 1 1 1 5 0 0 1 0 0 0 1 0 0 0 1 1 1 1 1 1 1 5 0 0 1 0 0 0 1 0 0 0 1 1 1 1 1 1 1 5 0 0 1 0 0 0 0 1 0 0 1 1 1 1 0 1 1 4 0 0 1 0 0 0 0 0 1 0 1 1 1 1 0 1 1 4 0 0 1 0 0 0 0 0 0 1 1 1 1 1 0 1 1 4 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 3 3 3 1 0 0 0 0 1 0 0 0 0 1 1 0 1 0 1 1 3 1 0 0 0 0 1 0 1 1 0 1 1 0 1 0 1 3 3 0 1 1 0 0 1 0 0 0 0 1 1 1 0 0 2 1 3 0 1 0 0 0 1 0 0 0 0 1 1 1 0 0 1 1 3 0 1 0 0 0 1 0 0 0 0 1 1 1 0 0 1 1 3 1 0 1 1 0 1 1 1 1 0 1 1 0 0 0 3 4 2 1 0 0 0 0 1 1 1 1 0 1 1 0 0 0 1 4 2 1 0 0 0 0 0 1 0 0 0 1 1 0 0 0 1 1 2 1 0 1 0 0 0 0 1 1 0 1 1 1 1 0 2 2 4 1 0 0 0 0 0 0 1 1 0 1 1 1 1 0 1 2 4 1 0 0 0 0 0 0 1 0 0 1 1 1 1 0 1 1 4 1 0 0 0 0 0 0 0 1 0 1 1 1 1 0 1 1 4 1 0 0 0 0 0 0 0 0 1 0 1 1 1 0 1 1 3 1 0 1 0 0 0 0 1 1 1 0 1 1 1 0 3 3 3 1 0 0 0 0 0 0 1 1 1 0 1 1 1 0 1 3 3 0 1 1 0 0 1 1 1 1 1 0 1 1 0 0 2 5 2 0 1 0 0 0 0 1 0 0 0 0 1 1 0 0 1 1 2 0 1 0 0 0 1 1 1 1 1 0 1 1 0 0 1 5 2 0 1 0 0 0 0 0 1 0 0 0 1 1 0 0 1 1 2 0 1 0 0 0 0 0 0 1 0 0 1 1 0 0 1 1 2 0 1 0 0 0 0 0 0 0 1 0 1 1 0 0 1 1 2 0 0 0 1 0 1 0 0 0 0 1 1 0 1 0 1 1 3 0 0 0 1 0 1 1 1 1 1 1 1 0 1 0 1 5 3 0 0 1 1 0 1 1 1 1 1 1 1 0 1 0 2 5 3 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 1 1 3 0 0 0 1 0 0 0 1 0 0 1 1 0 1 0 1 1 3 0 0 0 1 0 0 0 0 1 0 1 1 0 1 0 1 1 3 0 0 0 1 0 0 0 0 0 1 1 1 0 1 0 1 1 3 0 0 0 0 1 1 0 0 0 1 1 1 0 1 0 1 2 3 0 0 1 1 1 1 0 0 0 1 1 1 0 1 0 3 2 3 0 0 0 0 1 1 0 0 0 0 1 1 0 1 0 1 1 3 0 0 0 0 1 0 1 0 0 0 1 0 0 1 0 1 1 2 0 0 1 1 1 1 1 0 0 1 1 0 0 1 0 3 3 2 0 0 0 0 1 1 1 0 0 1 1 0 0 1 0 1 3 2 0 0 0 0 1 1 0 1 0 1 1 1 0 0 0 1 3 2 0 0 1 1 1 1 0 1 0 1 1 1 0 0 0 3 3 2 0 0 0 0 1 0 0 1 0 0 1 1 0 0 0 1 1 2 0 1 1 1 1 1 0 1 1 1 0 1 0 0 0 4 4 1 0 0 0 0 1 0 0 0 1 0 0 1 0 0 0 1 1 1 0 0 0 0 1 1 0 1 1 1 0 1 0 0 0 1 4 1 0 0 0 0 1 0 0 0 0 1 1 1 0 1 0 1 1 3 aoa oaa (all of these Max Cliques, only 3 new ones) Stock Investor Day Base cTrees A B C D E 1 0 0 0 0 1 0 0 0 0 1 1 1 1 1 1 1 5 1 0 0 0 0 1 1 0 0 0 1 1 1 1 1 1 2 5 1 0 0 0 0 0 1 0 0 0 1 1 1 1 1 1 1 5 1 0 0 0 0 0 0 1 0 0 0 1 1 0 0 1 1 2 1 0 0 0 0 1 1 1 0 0 0 1 1 0 0 1 3 2 1 0 0 0 0 0 0 0 1 0 1 0 1 1 1 1 1 4 1 0 0 0 0 1 1 0 1 0 1 0 1 1 1 1 3 4 1 0 1 0 0 1 1 0 0 0 1 1 1 1 1 2 2 5 1 0 1 0 0 1 1 1 0 0 0 1 1 0 0 2 3 2 1 0 1 1 0 1 1 0 1 0 1 0 1 1 1 3 3 4 1 0 1 0 0 1 1 0 0 0 1 0 1 1 1 2 2 4 0 1 0 0 0 1 0 0 0 0 1 0 1 1 1 1 1 4 0 1 0 0 0 1 0 0 0 0 1 0 1 1 1 1 1 4 1 1 1 1 0 1 0 0 0 0 1 0 1 1 1 4 1 4 0 1 0 0 0 0 1 0 0 0 1 1 1 1 0 1 1 4 0 1 0 0 0 0 1 0 0 0 1 1 1 1 0 1 1 4 0 1 0 0 0 0 1 1 0 0 0 1 1 0 0 1 2 2 0 1 0 0 0 0 0 1 0 0 0 1 1 0 0 1 1 2 0 1 0 0 0 1 0 0 1 0 0 0 1 1 1 1 2 3 0 1 0 0 0 0 0 0 1 0 0 0 1 1 1 1 1 3 0 1 0 0 0 0 0 0 0 1 0 0 1 0 0 1 1 1 0 1 0 0 0 1 1 1 1 1 0 0 1 0 0 1 5 1 0 0 1 0 0 1 1 0 0 0 1 0 1 1 1 1 2 4 0 0 1 0 0 1 0 0 0 0 1 0 1 1 1 1 1 4 0 0 1 0 0 0 1 0 0 0 1 1 1 1 1 1 1 5 0 0 1 0 0 0 0 1 0 0 1 1 1 0 0 1 1 3 0 0 1 0 0 1 1 1 0 0 1 1 1 0 0 1 3 3 0 0 1 0 0 1 1 0 1 0 1 0 1 1 0 1 3 3 0 0 1 0 0 0 0 0 1 0 1 0 1 1 0 1 1 3 0 0 0 1 0 1 0 0 0 0 1 0 1 1 0 1 1 3 0 0 0 1 0 1 1 0 1 0 1 0 1 1 0 1 3 3 0 0 0 1 0 0 1 0 0 0 1 1 1 1 1 1 1 5 0 0 0 1 0 0 1 0 0 0 1 1 1 1 1 1 1 5 0 0 0 1 0 0 1 1 0 0 1 1 1 0 0 1 2 3 0 0 0 1 0 0 0 1 0 0 1 1 1 0 0 1 1 3 0 0 0 1 0 0 0 0 1 0 1 0 1 1 0 1 1 3 0 0 0 1 0 1 1 0 1 0 1 0 1 1 0 1 3 3 0 0 0 0 1 1 0 0 0 0 0 0 1 1 1 1 1 3 0 0 0 0 1 1 1 0 1 0 0 0 1 1 1 1 3 3 0 0 0 0 1 0 1 0 0 0 1 1 1 1 1 1 1 5 0 0 0 0 1 0 1 0 0 0 1 1 1 1 1 1 1 5 0 0 0 0 1 0 1 1 0 0 1 1 1 0 0 1 2 3 0 0 0 0 1 0 0 1 0 0 1 1 1 0 0 1 1 3 0 0 0 0 1 0 0 0 1 0 1 0 1 1 1 1 1 4 0 0 0 0 1 0 1 0 1 0 1 0 1 1 1 1 2 4 1 1 1 1 1 0 1 0 0 0 1 1 1 1 0 5 1 4 1 1 1 1 1 0 1 1 0 0 0 1 1 0 0 5 2 2 1 1 0 1 1 1 0 0 1 0 0 0 1 1 1 4 2 3 0 1 0 0 0 1 1 1 1 1 0 0 1 0 0 1 5 1 0 0 1 0 0 1 1 1 0 0 1 1 1 0 0 1 3 3 1 0 1 1 1 0 1 0 0 0 1 1 1 1 1 4 1 5 0 0 1 1 1 0 1 1 0 0 1 1 1 0 0 3 2 3 1 0 0 0 1 1 1 0 1 0 0 0 1 1 1 2 3 3 1 0 0 0 1 0 1 0 1 0 1 0 1 1 1 2 2 4 1 2 3 4 5 CtD aoa oaa (all of these Max Cliques, only 3 new ones)
Base CliqueTrees for H3 last 3. Investor Stock Day cTrees 1 2 3 4 5 1 1 0 0 0 1 0 1 0 0 1 1 1 1 1 2 2 5 1 0 0 0 0 1 0 0 0 0 1 1 1 1 1 1 1 5 1 0 0 0 0 1 0 1 0 0 1 1 1 1 1 1 2 5 0 1 0 0 0 1 0 1 1 1 1 1 1 1 1 1 4 5 0 1 0 0 0 1 0 0 0 0 1 1 1 1 1 1 1 5 0 1 0 0 0 1 0 1 1 1 1 1 1 1 1 1 4 5 0 0 1 0 0 1 1 1 1 1 0 1 1 0 0 1 5 2 0 1 1 0 0 1 1 1 1 1 0 1 1 0 0 2 5 2 0 0 1 0 0 1 0 0 0 0 0 1 1 0 0 1 1 2 0 0 0 1 0 1 0 0 0 1 1 0 1 1 1 1 2 4 0 1 0 1 0 1 0 0 0 1 1 0 1 1 1 2 2 4 0 0 0 1 0 1 0 0 0 0 1 0 1 1 1 1 1 4 1 0 0 0 0 1 1 1 0 0 1 0 1 1 1 1 3 4 1 0 0 0 0 1 1 1 0 0 1 0 1 1 1 1 3 4 1 0 0 0 0 0 1 0 0 0 1 0 1 1 1 1 1 4 1 0 0 0 0 0 0 1 0 0 1 0 1 1 1 1 1 5 1 0 0 0 0 1 1 1 1 0 1 0 1 1 1 1 4 4 1 0 0 0 0 1 1 1 1 0 1 0 1 1 1 1 4 4 1 0 0 0 0 0 0 0 1 0 1 0 1 1 0 1 1 3 1 0 0 0 0 1 1 1 0 1 0 0 1 1 1 1 4 3 1 0 0 0 0 1 1 1 0 1 0 0 1 1 1 1 4 3 1 0 0 0 0 0 0 0 0 1 0 0 1 1 1 1 1 3 0 1 0 0 0 0 1 0 0 0 1 1 1 1 0 1 1 4 0 1 0 0 0 1 1 1 1 1 1 1 1 1 0 1 5 4 0 1 0 0 0 1 1 1 1 1 1 1 1 1 0 1 5 4 0 1 0 0 0 0 0 1 0 0 1 1 1 1 1 1 1 5 0 1 0 0 0 0 0 0 1 0 1 1 1 1 1 1 1 5 0 1 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 5 0 0 1 0 0 0 1 0 0 0 0 1 1 0 0 1 1 2 0 0 1 0 0 0 0 1 1 1 1 1 1 0 0 1 3 3 0 1 1 0 0 0 0 1 1 1 1 1 1 0 0 2 3 3 0 0 1 0 0 0 0 1 0 0 1 1 1 0 0 1 1 3 0 0 1 0 0 0 0 0 1 0 1 1 1 0 0 1 1 3 0 0 1 0 0 0 0 0 0 1 1 1 1 0 0 1 1 3 0 0 0 1 0 0 1 0 0 0 0 0 1 1 0 1 1 2 0 1 0 1 0 1 1 1 1 1 0 0 1 1 0 2 5 2 0 0 0 1 0 1 1 1 1 1 0 0 1 1 0 1 5 2 0 0 0 1 0 1 0 1 1 1 1 0 1 1 0 1 4 3 0 0 0 1 0 0 0 1 0 0 1 0 1 1 0 1 1 3 0 1 0 1 0 1 0 1 1 1 1 0 1 1 0 2 4 3 0 0 0 1 0 0 0 0 1 0 1 0 1 1 0 1 1 3 0 0 0 1 0 0 0 0 0 1 1 0 1 1 1 1 1 4 0 0 0 0 1 0 1 0 0 0 0 0 1 0 0 1 1 1 0 0 0 0 1 0 1 0 0 0 0 0 1 0 0 1 1 1 1 1 1 1 1 0 1 0 0 0 0 0 1 0 0 5 1 1 A B C D E aoa oaa (all of these will be Max Cliques) Day Investor Stock cTrees 1 0 0 0 0 1 0 0 0 0 1 1 1 1 0 1 1 4 1 0 1 1 0 1 1 0 0 0 1 1 1 1 0 3 2 4 1 0 0 0 0 1 1 0 0 0 1 1 1 1 0 1 2 4 1 1 1 1 0 0 1 0 0 0 1 1 1 1 1 4 1 5 1 0 0 0 0 0 1 0 0 0 1 1 1 1 1 1 1 5 1 0 0 0 0 0 1 0 0 0 1 1 1 1 1 1 1 5 1 0 0 0 0 0 1 1 1 0 0 0 1 1 1 1 3 3 1 0 0 0 0 0 0 1 0 0 0 0 1 1 1 1 1 3 1 0 1 0 0 0 1 1 1 0 0 0 1 1 1 2 3 3 1 0 0 0 0 0 1 0 1 0 1 0 1 1 1 1 2 4 1 0 0 0 0 0 0 0 1 0 1 0 1 1 1 1 1 4 1 0 1 1 0 0 1 0 1 0 1 0 1 1 1 3 2 4 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0 1 1 1 0 1 0 0 0 1 1 1 0 0 1 0 0 0 0 1 3 1 0 1 1 0 0 1 1 1 0 0 1 0 0 0 0 2 3 1 0 1 0 0 0 0 1 0 0 0 1 1 1 1 1 1 1 5 0 1 0 0 0 0 1 1 0 0 1 1 1 1 1 1 2 5 0 1 1 0 0 0 1 1 0 0 1 1 1 1 1 2 2 5 0 1 0 0 0 0 0 1 0 0 1 1 1 1 1 1 1 5 0 0 1 0 0 1 1 1 1 0 1 1 1 1 1 1 4 5 0 0 1 0 0 1 1 1 1 0 1 1 1 1 1 1 4 5 0 0 1 0 0 1 0 0 0 0 1 1 1 1 1 1 1 5 0 0 1 0 0 0 1 0 0 0 1 1 1 1 1 1 1 5 0 0 1 0 0 0 0 1 0 0 1 1 1 1 1 1 1 5 0 0 1 0 0 0 0 0 1 0 1 1 1 1 1 1 1 5 0 0 1 0 0 0 0 0 0 1 0 1 0 0 0 1 1 1 0 0 1 0 0 1 1 1 1 1 0 1 0 0 0 1 5 1 0 0 1 0 0 1 1 1 1 1 0 1 0 0 0 1 5 1 0 0 0 0 1 1 0 0 0 0 1 1 1 0 1 1 1 4 0 0 1 1 1 1 0 0 0 0 1 1 1 0 1 3 1 4 0 0 0 0 1 1 0 0 0 0 1 1 1 0 1 1 1 4 0 0 0 0 1 0 1 0 0 0 1 0 1 1 1 1 1 4 1 1 1 1 1 0 1 0 0 0 1 0 1 1 1 5 1 4 0 0 0 0 1 0 1 0 0 0 1 0 1 1 1 1 1 4 0 0 1 1 0 1 1 0 1 0 1 1 1 1 1 2 3 5 0 0 0 1 0 1 0 0 0 0 1 1 1 1 1 1 1 5 0 0 0 1 0 1 1 0 1 0 1 1 1 1 1 1 3 5 0 0 0 1 0 0 1 0 0 0 1 1 1 1 1 1 1 5 0 0 0 1 0 0 0 0 1 0 1 1 1 1 1 1 1 5 0 0 0 0 1 1 0 0 1 0 1 1 0 0 1 1 2 3 0 0 1 1 1 1 0 0 1 0 1 1 0 0 1 3 2 3 0 0 0 0 1 0 0 0 1 0 1 1 0 0 1 1 1 3 1 2 3 4 5 A B C D E oaa (all of these will be Max Cliques) aoa Investor Day Stock cTrees 0 1 0 0 0 0 0 1 0 0 1 1 1 1 1 1 1 5 1 0 0 0 0 1 0 1 1 0 1 1 1 1 0 1 3 4 1 0 0 0 0 1 0 0 0 0 1 1 1 1 0 1 1 4 1 1 0 0 0 1 0 1 1 0 1 1 1 1 0 2 3 4 1 0 0 0 0 0 0 1 1 0 1 1 1 1 1 1 2 5 1 1 0 1 0 0 0 1 1 0 1 1 1 1 1 3 2 5 1 0 0 0 0 0 0 1 0 0 1 1 1 1 1 1 1 5 0 1 0 0 0 1 0 0 0 0 1 1 1 1 1 1 1 5 0 1 0 0 0 1 1 1 1 0 1 1 1 1 1 1 4 5 0 1 0 0 0 1 1 1 1 0 1 1 1 1 1 1 4 5 0 0 0 0 1 0 0 1 0 0 0 1 0 0 0 1 1 1 0 0 0 0 1 0 0 1 0 0 0 1 0 0 0 1 1 1 1 1 1 1 1 0 0 1 0 0 0 1 0 0 0 5 1 1 0 1 0 0 0 1 1 1 1 1 1 0 1 1 1 1 5 4 0 1 0 0 0 1 1 1 1 1 1 0 1 1 1 1 5 4 0 1 0 0 0 0 0 0 0 1 1 0 1 1 1 1 1 4 1 0 0 0 0 0 0 1 1 1 1 1 1 0 1 1 3 4 1 0 0 0 0 0 0 1 1 1 1 1 1 0 1 1 3 4 1 0 0 0 0 0 0 0 0 1 1 1 1 0 1 1 1 4 0 0 0 1 0 0 0 0 1 0 1 1 1 1 1 1 1 5 1 2 3 4 5 0 1 0 0 0 0 0 0 1 0 1 1 1 1 1 1 1 5 1 0 0 0 0 0 0 0 1 0 1 1 1 1 1 1 1 5 0 0 1 0 0 0 1 0 0 0 1 1 1 1 1 1 1 5 0 0 1 0 0 0 1 1 0 0 1 1 1 1 1 1 2 5 0 1 1 0 0 0 1 1 0 0 1 1 1 1 1 2 2 5 0 1 0 0 0 0 1 0 0 0 1 1 1 1 1 1 1 5 0 0 1 0 0 1 0 0 0 0 0 0 1 1 1 1 1 3 0 1 1 0 0 1 1 1 0 0 0 0 1 1 1 2 3 3 0 0 1 0 0 1 1 1 0 0 0 0 1 1 1 1 3 3 1 1 0 0 0 1 1 1 1 1 1 0 0 0 0 2 5 1 1 0 0 0 0 1 1 1 1 1 1 0 0 0 0 1 5 1 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 1 1 0 0 0 1 0 1 0 1 1 0 1 0 1 1 1 1 3 4 0 1 0 1 0 1 0 1 1 0 1 0 1 1 1 2 3 4 0 0 0 1 0 1 0 0 0 0 1 0 1 1 1 1 1 4 1 1 0 1 0 0 0 1 1 0 1 1 1 1 1 3 2 5 0 0 0 1 0 0 0 1 1 0 1 1 1 1 1 1 2 5 0 0 0 1 0 0 0 1 0 0 1 1 1 1 1 1 1 5 0 0 1 0 0 0 0 1 0 0 1 1 1 1 1 1 1 5 1 1 0 1 0 0 0 1 1 1 1 1 0 0 1 3 3 3 0 0 0 1 0 0 0 1 1 1 1 1 0 0 1 1 3 3 0 0 0 1 0 0 0 0 0 1 1 1 0 0 1 1 1 3 A B C D E aoa oaa (all of these will be Max Cliques)
aoa then oaa on the 6 cTrees (removing duplicates - no covers since aoa then oaa gives Maximal Cliques only). We get 34 MCs below. Theorem: These 34 MCs are the only Maxmal Cliques. General thm: {a..ao(a..oa(…oa..a(B)|B=BaseClique} is the MaxCliqueSet. Thus, for a bipartite graph, ao(B) is MCS. Maximal Base CliqueTrees for H3 1 0 0 0 0 1 0 1 1 1 1 1 0 1 0 1 4 3 1 0 0 0 0 0 1 1 0 0 1 1 1 0 0 1 2 3 1 1 1 1 1 0 0 1 0 0 1 1 1 1 0 5 1 4 1 1 1 1 0 1 0 1 1 0 1 1 0 0 0 4 3 2 1 1 1 1 1 0 1 1 0 0 0 1 1 0 0 5 2 2 0 1 0 0 0 0 0 1 0 0 1 1 1 1 1 1 1 5 1 1 1 1 1 0 0 1 1 0 1 1 0 1 0 5 2 3 1 1 0 0 1 0 0 1 1 1 1 0 0 1 0 3 3 2 0 0 1 1 0 1 0 1 0 0 1 1 1 1 0 2 2 4 0 0 1 1 1 1 1 1 0 0 0 1 1 0 0 3 3 2 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 3 3 3 1 0 1 0 0 1 0 1 1 1 1 1 0 0 0 2 4 2 0 0 1 1 0 1 0 1 0 0 1 1 1 1 0 2 2 4 0 0 0 1 0 1 1 1 1 1 0 1 0 0 0 1 5 1 0 0 1 1 1 1 0 1 0 0 0 1 1 1 0 3 2 3 1 0 0 0 1 0 0 1 1 1 1 1 0 1 0 2 3 3 1 0 0 0 0 1 0 1 1 1 1 1 0 1 0 1 4 3 1 0 0 0 0 0 1 1 0 0 1 1 1 0 0 1 2 3 1 1 1 1 1 0 0 1 0 0 1 1 1 1 0 5 1 4 1 1 1 1 0 1 0 1 1 0 1 1 0 0 0 4 3 2 1 1 1 1 1 0 1 1 0 0 0 1 1 0 0 5 2 2 0 1 0 0 0 0 0 1 0 0 1 1 1 1 1 1 1 5 1 1 1 1 1 0 0 1 1 0 1 1 0 1 0 5 2 3 1 1 0 0 1 0 0 1 1 1 1 0 0 1 0 3 3 2 0 0 1 1 0 1 0 1 0 0 1 1 1 1 0 2 2 4 0 0 1 1 1 1 1 1 0 0 0 1 1 0 0 3 3 2 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 3 3 3 1 0 1 0 0 1 0 1 1 1 1 1 0 0 0 2 4 2 0 0 1 1 0 1 0 1 0 0 1 1 1 1 0 2 2 4 0 0 0 1 0 1 1 1 1 1 0 1 0 0 0 1 5 1 0 0 1 1 1 1 0 1 0 0 0 1 1 1 0 3 2 3 1 0 0 0 1 0 0 1 1 1 1 1 0 1 0 2 3 3 A B C D E 1 0 1 0 0 1 1 1 1 1 1 1 0 0 0 2 5 2 1 0 1 0 0 0 1 1 0 0 1 1 1 0 0 2 2 3 1 0 1 1 0 1 0 1 1 1 1 1 0 1 0 3 4 3 0 0 1 1 1 1 0 1 0 0 0 1 1 1 0 3 3 3 1 0 1 0 1 0 0 1 1 1 1 1 0 0 0 3 3 2 1 0 1 1 1 0 1 1 1 1 0 1 0 0 0 4 4 1 1 1 1 1 0 1 0 1 1 1 1 0 0 0 0 4 4 1 1 1 1 1 1 1 1 1 1 0 0 1 0 0 0 5 4 1 1 1 0 1 1 0 0 1 1 1 1 0 0 1 0 4 3 2 0 0 1 0 0 1 1 1 0 0 1 1 1 0 0 1 3 3 1 0 1 1 1 1 1 1 1 1 0 1 0 0 0 4 5 1 1 0 0 0 1 1 0 1 1 1 0 1 0 1 0 2 4 2 1 0 1 0 0 1 1 1 1 1 1 1 0 0 0 2 5 2 1 0 1 0 0 0 1 1 0 0 1 1 1 0 0 2 2 3 1 0 1 1 0 1 0 1 1 1 1 1 0 1 0 3 4 3 0 0 1 1 1 1 0 1 0 0 0 1 1 1 0 3 3 3 1 0 1 0 1 0 0 1 1 1 1 1 0 0 0 3 3 2 1 0 1 1 1 0 1 1 1 1 0 1 0 0 0 4 4 1 1 1 1 1 0 1 0 1 1 1 1 0 0 0 0 4 4 1 1 1 1 1 1 1 1 1 1 0 0 1 0 0 0 5 4 1 1 1 0 1 1 0 0 1 1 1 1 0 0 1 0 4 3 2 0 0 1 0 0 1 1 1 0 0 1 1 1 0 0 1 3 3 1 0 1 1 1 1 1 1 1 1 0 1 0 0 0 4 5 1 1 0 0 0 1 1 0 1 1 1 0 1 0 1 0 2 4 2 1 1 1 0 0 1 0 1 1 1 1 0 0 0 0 3 4 1 1 1 1 0 1 0 0 1 1 1 1 0 0 0 0 4 3 1 1 1 1 1 1 0 0 1 1 0 0 1 0 1 0 5 2 2 1 0 1 1 1 1 0 1 1 0 0 1 0 1 0 4 3 2 A B C D E 1 1 0 0 0 1 0 1 0 0 1 1 1 1 1 2 2 5 0 1 0 0 0 1 0 1 1 1 1 1 1 1 1 1 4 5 0 1 1 0 0 1 1 1 1 1 0 1 1 0 0 2 5 2 0 1 0 1 0 1 0 0 0 1 1 0 1 1 1 2 2 4 1 0 0 0 0 1 1 1 0 0 1 0 1 1 1 1 3 4 1 0 0 0 0 1 1 1 1 0 1 0 1 1 1 1 4 4 1 0 0 0 0 1 1 1 0 1 0 0 1 1 1 1 4 3 0 1 0 0 0 1 1 1 1 1 1 1 1 1 0 1 5 4 0 1 1 0 0 0 0 1 1 1 1 1 1 0 0 2 3 3 0 1 0 1 0 1 1 1 1 1 0 0 1 1 0 2 5 2 0 1 0 1 0 1 0 1 1 1 1 0 1 1 0 2 4 3 1 1 1 1 1 0 1 0 0 0 0 0 1 0 0 5 1 1 1 0 0 0 0 1 0 1 1 1 1 1 0 1 0 1 4 3 1 0 0 0 0 0 1 1 0 0 1 1 1 0 0 1 2 3 1 1 1 1 1 0 0 1 0 0 1 1 1 1 0 5 1 4 1 1 1 1 0 1 0 1 1 0 1 1 0 0 0 4 3 2 1 1 1 1 1 0 1 1 0 0 0 1 1 0 0 5 2 2 0 1 0 0 0 0 0 1 0 0 1 1 1 1 1 1 1 5 1 1 1 1 1 0 0 1 1 0 1 1 0 1 0 5 2 3 1 1 0 0 1 0 0 1 1 1 1 0 0 1 0 3 3 2 0 0 1 1 0 1 0 1 0 0 1 1 1 1 0 2 2 4 0 0 1 1 1 1 1 1 0 0 0 1 1 0 0 3 3 2 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 3 3 3 1 0 1 0 0 1 0 1 1 1 1 1 0 0 0 2 4 2 0 0 1 1 0 1 0 1 0 0 1 1 1 1 0 2 2 4 0 0 0 1 0 1 1 1 1 1 0 1 0 0 0 1 5 1 0 0 1 1 1 1 0 1 0 0 0 1 1 1 0 3 2 3 1 0 0 0 1 0 0 1 1 1 1 1 0 1 0 2 3 3 1 2 3 4 5 1 2 3 4 5 A B C D E 1 0 0 0 0 1 0 1 1 1 1 1 0 1 0 1 4 3 1 0 0 0 0 0 1 1 0 0 1 1 1 0 0 1 2 3 1 1 1 1 1 0 0 1 0 0 1 1 1 1 0 5 1 4 1 1 1 1 0 1 0 1 1 0 1 1 0 0 0 4 3 2 1 1 1 1 1 0 1 1 0 0 0 1 1 0 0 5 2 2 0 1 0 0 0 0 0 1 0 0 1 1 1 1 1 1 1 5 1 1 1 1 1 0 0 1 1 0 1 1 0 1 0 5 2 3 1 1 0 0 1 0 0 1 1 1 1 0 0 1 0 3 3 2 0 0 1 1 0 1 0 1 0 0 1 1 1 1 0 2 2 4 0 0 1 1 1 1 1 1 0 0 0 1 1 0 0 3 3 2 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 3 3 3 1 0 1 0 0 1 0 1 1 1 1 1 0 0 0 2 4 2 0 0 1 1 0 1 0 1 0 0 1 1 1 1 0 2 2 4 0 0 0 1 0 1 1 1 1 1 0 1 0 0 0 1 5 1 0 0 1 1 1 1 0 1 0 0 0 1 1 1 0 3 2 3 1 0 0 0 1 0 0 1 1 1 1 1 0 1 0 2 3 3 A B C D E 1 0 1 0 0 1 1 1 1 1 1 1 0 0 0 2 5 2 1 0 1 0 0 0 1 1 0 0 1 1 1 0 0 2 2 3 1 0 1 1 0 1 0 1 1 1 1 1 0 1 0 3 4 3 1 2 3 4 5 0 0 1 1 1 1 0 1 0 0 0 1 1 1 0 3 3 3 1 0 1 0 1 0 0 1 1 1 1 1 0 0 0 3 3 2 1 0 1 1 1 0 1 1 1 1 0 1 0 0 0 4 4 1 1 1 1 1 0 1 0 1 1 1 1 0 0 0 0 4 4 1 1 1 1 1 1 1 1 1 1 0 0 1 0 0 0 5 4 1 1 1 0 1 1 0 0 1 1 1 1 0 0 1 0 4 3 2 0 0 1 0 0 1 1 1 0 0 1 1 1 0 0 1 3 3 1 0 1 1 1 1 1 1 1 1 0 1 0 0 0 4 5 1 1 0 0 0 1 1 0 1 1 1 0 1 0 1 0 2 4 2 1 1 1 0 0 1 0 1 1 1 1 0 0 0 0 3 4 1 1 1 1 0 1 0 0 1 1 1 1 0 0 0 0 4 3 1 1 1 1 1 1 0 0 1 1 0 0 1 0 1 0 5 2 2 1 0 1 1 1 1 0 1 1 0 0 1 0 1 0 4 3 2 1 2 3 4 5 A B C D E 1 2 3 4 5 1 0 1 1 0 1 1 0 0 0 1 1 1 1 0 3 2 4 1 1 1 1 0 0 1 0 0 0 1 1 1 1 1 4 1 5 1 0 1 0 0 0 1 1 1 0 0 0 1 1 1 2 3 3 1 0 1 1 0 0 1 0 1 0 1 0 1 1 1 3 2 4 0 1 1 0 0 1 1 1 0 0 1 0 0 0 0 2 3 1 0 1 1 0 0 0 1 1 0 0 1 1 1 1 1 2 2 5 0 0 1 0 0 1 1 1 1 0 1 1 1 1 1 1 4 5 0 0 1 0 0 1 1 1 1 1 0 1 0 0 0 1 5 1 0 0 1 1 1 1 0 0 0 0 1 1 1 0 1 3 1 4 1 1 1 1 1 0 1 0 0 0 1 0 1 1 1 5 1 4 0 0 1 1 0 1 1 0 1 0 1 1 1 1 1 2 3 5 0 0 1 1 1 1 0 0 1 0 1 1 0 0 1 3 2 3 0 0 1 0 0 1 1 1 1 1 1 1 1 1 0 1 5 4 0 0 1 0 0 0 1 0 0 0 1 1 1 1 1 1 1 5 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 3 3 3 0 1 1 0 0 1 0 0 0 0 1 1 1 0 0 2 1 3 1 0 1 1 0 1 1 1 1 0 1 1 0 0 0 3 4 2 1 0 1 0 0 0 0 1 1 0 1 1 1 1 0 2 2 4 1 0 1 0 0 0 0 1 1 1 0 1 1 1 0 3 3 3 0 1 1 0 0 1 1 1 1 1 0 1 1 0 0 2 5 2 0 0 1 1 0 1 1 1 1 1 1 1 0 1 0 2 5 3 0 0 1 1 1 1 0 0 0 1 1 1 0 1 0 3 2 3 0 0 1 1 1 1 1 0 0 1 1 0 0 1 0 3 3 2 0 0 1 1 1 1 0 1 0 1 1 1 0 0 0 3 3 2 0 1 1 1 1 1 0 1 1 1 0 1 0 0 0 4 4 1 A B C D E 1 2 3 4 5 A B C D E 1 0 0 0 0 1 0 1 1 1 1 1 0 1 0 1 4 3 1 0 0 0 0 0 1 1 0 0 1 1 1 0 0 1 2 3 1 1 1 1 1 0 0 1 0 0 1 1 1 1 0 5 1 4 1 1 1 1 0 1 0 1 1 0 1 1 0 0 0 4 3 2 1 1 1 1 1 0 1 1 0 0 0 1 1 0 0 5 2 2 0 1 0 0 0 0 0 1 0 0 1 1 1 1 1 1 1 5 1 1 1 1 1 0 0 1 1 0 1 1 0 1 0 5 2 3 1 1 0 0 1 0 0 1 1 1 1 0 0 1 0 3 3 2 0 0 1 1 0 1 0 1 0 0 1 1 1 1 0 2 2 4 0 0 1 1 1 1 1 1 0 0 0 1 1 0 0 3 3 2 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 3 3 3 1 0 1 0 0 1 0 1 1 1 1 1 0 0 0 2 4 2 0 0 1 1 0 1 0 1 0 0 1 1 1 1 0 2 2 4 0 0 0 1 0 1 1 1 1 1 0 1 0 0 0 1 5 1 0 0 1 1 1 1 0 1 0 0 0 1 1 1 0 3 2 3 1 0 0 0 1 0 0 1 1 1 1 1 0 1 0 2 3 3 0 0 1 1 1 1 0 1 0 0 0 1 1 1 0 3 3 3 1 0 1 0 1 0 0 1 1 1 1 1 0 0 0 3 3 2 1 0 1 1 1 0 1 1 1 1 0 1 0 0 0 4 4 1 1 2 3 4 5 A B C D E 1 2 3 4 5 1 2 3 4 5 A B C D E 1 1 0 0 0 1 0 1 1 0 1 1 1 1 0 2 3 4 1 1 0 1 0 0 0 1 1 0 1 1 1 1 1 3 2 5 0 1 0 0 0 1 1 1 1 0 1 1 1 1 1 1 4 5 1 1 1 1 1 0 0 1 0 0 0 1 0 0 0 5 1 1 0 1 0 0 0 1 1 1 1 1 1 0 1 1 1 1 5 4 1 0 0 0 0 0 0 1 1 1 1 1 1 0 1 1 3 4 0 1 1 0 0 0 1 1 0 0 1 1 1 1 1 2 2 5 0 1 1 0 0 1 1 1 0 0 0 0 1 1 1 2 3 3 1 1 0 0 0 1 1 1 1 1 1 0 0 0 0 2 5 1 0 1 0 1 0 1 0 1 1 0 1 0 1 1 1 2 3 4 1 1 0 1 0 0 0 1 1 0 1 1 1 1 1 3 2 5 1 1 0 1 0 0 0 1 1 1 1 1 0 0 1 3 3 3 1 0 1 0 0 1 1 0 0 0 1 1 1 1 1 2 2 5 1 0 1 0 0 1 1 1 0 0 0 1 1 0 0 2 3 2 1 0 1 1 0 1 1 0 1 0 1 0 1 1 1 3 3 4 1 0 1 0 0 1 1 0 0 0 1 0 1 1 1 2 2 4 1 1 1 1 0 1 0 0 0 0 1 0 1 1 1 4 1 4 1 1 1 1 1 0 1 0 0 0 1 1 1 1 0 5 1 4 1 1 1 1 1 0 1 1 0 0 0 1 1 0 0 5 2 2 1 1 0 1 1 1 0 0 1 0 0 0 1 1 1 4 2 3 0 1 0 0 0 1 1 1 1 1 0 0 1 0 0 1 5 1 0 0 1 0 0 1 1 1 0 0 1 1 1 0 0 1 3 3 1 0 1 1 1 0 1 0 0 0 1 1 1 1 1 4 1 5 0 0 1 1 1 0 1 1 0 0 1 1 1 0 0 3 2 3 1 0 0 0 1 1 1 0 1 0 0 0 1 1 1 2 3 3 1 0 0 0 1 0 1 0 1 0 1 0 1 1 1 2 2 4 1 0 0 0 0 1 0 1 1 1 1 1 0 1 0 1 4 3 1 0 0 0 0 0 1 1 0 0 1 1 1 0 0 1 2 3 1 1 1 1 1 0 0 1 0 0 1 1 1 1 0 5 1 4 1 1 1 1 0 1 0 1 1 0 1 1 0 0 0 4 3 2 1 1 1 1 1 0 1 1 0 0 0 1 1 0 0 5 2 2 0 1 0 0 0 0 0 1 0 0 1 1 1 1 1 1 1 5 1 1 1 1 1 0 0 1 1 0 1 1 0 1 0 5 2 3 1 1 0 0 1 0 0 1 1 1 1 0 0 1 0 3 3 2 0 0 1 1 0 1 0 1 0 0 1 1 1 1 0 2 2 4 0 0 1 1 1 1 1 1 0 0 0 1 1 0 0 3 3 2 1 0 1 1 0 1 0 1 1 0 1 1 0 1 0 3 3 3 1 0 1 0 0 1 0 1 1 1 1 1 0 0 0 2 4 2 0 0 1 1 0 1 0 1 0 0 1 1 1 1 0 2 2 4 0 0 0 1 0 1 1 1 1 1 0 1 0 0 0 1 5 1 0 0 1 1 1 1 0 1 0 0 0 1 1 1 0 3 2 3 1 0 0 0 1 0 0 1 1 1 1 1 0 1 0 2 3 3 A B C D E 1 0 1 0 0 1 1 1 1 1 1 1 0 0 0 2 5 2 1 0 1 0 0 0 1 1 0 0 1 1 1 0 0 2 2 3 1 0 1 1 0 1 0 1 1 1 1 1 0 1 0 3 4 3 0 0 1 1 1 1 0 1 0 0 0 1 1 1 0 3 3 3 1 0 1 0 1 0 0 1 1 1 1 1 0 0 0 3 3 2 1 0 1 1 1 0 1 1 1 1 0 1 0 0 0 4 4 1 1 1 1 1 0 1 0 1 1 1 1 0 0 0 0 4 4 1 1 1 1 1 1 1 1 1 1 0 0 1 0 0 0 5 4 1 1 1 0 1 1 0 0 1 1 1 1 0 0 1 0 4 3 2 0 0 1 0 0 1 1 1 0 0 1 1 1 0 0 1 3 3 1 0 1 1 1 1 1 1 1 1 0 1 0 0 0 4 5 1 1 0 0 0 1 1 0 1 1 1 0 1 0 1 0 2 4 2 1 1 1 0 0 1 0 1 1 1 1 0 0 0 0 3 4 1 1 1 1 0 1 0 0 1 1 1 1 0 0 0 0 4 3 1 1 1 1 1 1 0 0 1 1 0 0 1 0 1 0 5 2 2 1 0 1 1 1 1 0 1 1 0 0 1 0 1 0 4 3 2 1 1 0 0 0 1 1 1 1 1 1 0 0 0 0 2 5 1 1 1 0 1 0 0 0 1 1 1 1 1 0 0 1 3 3 3 A B C D E 1 2 3 4 5 1 2 3 4 5
DOSPPE: Measure between-ness using One Shortest Path per Edge. Delete edges with highest betweenness until a Connected Component peals off, recalculate SP Counts, delete edges with highest, etc 1 0 1 1 1 1 1 1 1 1 0 1 1 1 1 0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 0 2 1 0 1 1 0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 3 1 1 0 1 0 0 0 1 1 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 0 4 1 1 1 0 0 0 0 1 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 5 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 6 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7 1 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 9 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 1 8 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 e 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 i 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 l 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 m 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 a 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 b 1 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 c 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 d 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 f 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 g 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 h 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 j 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 k 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 o 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 0 1 1 p 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 1 0 0 q 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 0 0 r 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 s 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 t 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 u 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 1 1 v 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 w 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 0 0 0 1 1 x 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 1 0 0 1 0 1 0 1 1 0 0 0 0 0 1 1 1 0 0 y 0 0 0 0 0 0 0 0 1 1 0 0 0 1 1 1 0 0 1 1 1 0 1 1 0 0 1 1 1 1 1 1 0 0 2 13 SPPCs 3 24 14 4 12 6 7 5 31 0 0 0 6 31 0 0 0 0 7 31 0 0 0 3 2 8 17 9 15 2 0 0 0 9 16 0 9 0 0 0 0 0 a 0 0 21 0 0 0 0 0 0 b 31 0 0 0 2 3 0 0 0 0 c 34 0 0 0 0 0 0 0 0 0 0 d 33 0 0 2 0 0 0 0 0 0 0 0 e 16 5 15 10 0 0 0 0 0 0 0 0 0 f 0 0 0 0 0 0 0 0 0 0 0 0 0 0 g 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 h 0 0 0 0 0 32 3 0 0 0 0 0 0 0 0 0 i 31 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 j 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 k 18 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 l 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 m 18 17 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 n 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 o 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 p 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 q 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 16 4 r 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 s 0 0 29 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 19 6 0 0 t 0 0 21 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 u 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 5 0 0 5 0 0 v 0 16 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 w 21 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 27 21 0 0 4 0 0 x 0 0 26 0 0 0 0 0 11 0 0 0 0 0 26 26 0 0 26 0 25 0 26 10 0 0 0 0 0 25 10 8 y 0 0 0 0 0 0 0 0 16 14 0 0 0 3 9 9 0 0 9 15 9 0 9 7 0 0 29 4 12 7 8 4 2 1 2 3 4 5 6 7 8 9 a b c d e f g h i j k l m n o p q r s t u v w x SPPC after deleting 5 6 7 11 17 10 12 13 14 15 16 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 1 2 3 4 8 9 a c d e f g i j k l m n o p q r s t u v w x 1 2 13 3 24 14 4 12 6 7 8 17 9 15 2 9 16 0 9 0 0 a 0 0 21 0 0 0 c 34 0 0 0 0 0 0 d 31 0 0 2 0 0 0 0 e 16 5 15 10 0 0 0 0 0 f 0 0 0 0 0 0 0 0 0 0 g 0 0 0 0 0 0 0 0 0 0 0 i 31 3 0 0 0 0 0 0 0 0 0 0 j 0 0 0 0 0 0 0 0 0 0 0 0 0 k 18 3 0 0 0 0 0 0 0 0 0 0 0 0 l 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 m 18 17 0 0 0 0 0 0 0 0 0 0 0 0 0 0 n 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 o 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 p 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 q 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 16 4 r 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 s 0 0 29 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 19 6 0 0 t 0 0 21 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 u 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 5 0 0 5 0 0 v 0 16 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 w 21 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 27 21 0 0 4 0 0 x 0 0 26 0 0 11 0 0 0 0 26 26 0 26 0 25 0 26 10 0 0 0 0 0 25 10 8 y 0 0 0 0 0 16 14 0 0 3 9 9 0 9 15 9 0 9 7 0 0 29 4 12 7 8 4 2 G7 Max SPPC=34 is at edge {1,12}DNI Next Max SPPC=33 is at edge {1,13} Next Max SPPC=32 is at edge {6,17} 1 2 3 4 5 6 7 8 9 10 a 11 b 12 c 13 d 14 e 15 f 16 g 17 h 18 i 19 j 20 k 21 l 22 m 23 n 24 o 25 p 26 q 27 r 28 s 29 t 30 u 31 v 32 w 33 x 34 y Next Max SPPC=31 is at edges {1,5} {5,6,7,11,17}=CC. Delete. Recalc. Start over Next Max SPPC=13 is at edges {1,2} {1,4} {29,34} Max SPPC=34 is at edge {1,12}DNI Next Max SPPC=31 is edges {1,18} {1,13}DNI Next Max SPPC=11 is at edges {9,33} Next Max SPPC=29 is edges {3,29} {27,34} Next Max SPPC=10 is at edges {4,14} {24,33} {31,33} Next Max SPPC=27 is at edge {25,32} Next Max SPPC=9 edges {2,8} {3,9} DNI{15,34} {16,34} {19,34} {23,34} Next Max SPPC=26 is at edges {3,33} {15,33} {16,33} {19,33} {23,33} Next Max SPPC=8 edges {31,34}DNI {32,33} Next Max SPPC=25 is at edges {21,33} {30,33} Next Max SPPC=7 edges {3,4}{30,34}DNI {24,34} Next Max SPPC=6 edges {25,28}DNI {2,14} Next Max SPPC=24 is at edges {1,3} {2,3} Next Max SPPC=21 is at edges {3,10} {1,32} {26,32} {24,28} {3,28} {1,2,3,4,8,12,13,18,20,22}=CC. Delete. Recalc. Start over Next Max SPPC=18 is at edges {1,20} {1,22} Next Max SPPC=17 is at edges {1,8} {2,22} Next Max SPPC=16 is at edges {1,9} {1,14} {24,26} {2,31} {9,34} Next Max SPPC=15 is at edges {3,8} {3,14} {10,34}DNI {20,34}
DOSPPE: Measure between-ness using One Shortest Path per Edge. Delete edges with highest betweenness until a Connected Component peals off, recalc, del next highest, etc 1 0 1 1 1 1 1 1 1 1 0 1 1 1 1 0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 0 2 1 0 1 1 0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 3 1 1 0 1 0 0 0 1 1 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 0 4 1 1 1 0 0 0 0 1 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 5 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 6 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7 1 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 9 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 1 8 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 e 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 i 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 l 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 m 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 a 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 b 1 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 c 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 d 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 f 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 g 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 h 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 j 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 k 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 o 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 0 1 1 p 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 1 0 0 q 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 0 0 r 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 s 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 t 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 u 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 1 1 v 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 w 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 0 0 0 1 1 x 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 1 0 0 1 0 1 0 1 1 0 0 0 0 0 1 1 1 0 0 y 0 0 0 0 0 0 0 0 1 1 0 0 0 1 1 1 0 0 1 1 1 0 1 1 0 0 1 1 1 1 1 1 0 0 SPPC after deleting 5 6 7 11 17 10 12 13 14 15 16 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 1 2 3 4 8 9 a c d e f g i j k l m n o p q r s t u v w x 1 2 13 3 24 14 4 12 6 7 8 17 9 15 2 9 16 0 9 0 0 a 0 0 21 0 0 0 c 34 0 0 0 0 0 0 d 31 0 0 2 0 0 0 0 e 16 5 15 10 0 0 0 0 0 f 0 0 0 0 0 0 0 0 0 0 g 0 0 0 0 0 0 0 0 0 0 0 i 31 3 0 0 0 0 0 0 0 0 0 0 j 0 0 0 0 0 0 0 0 0 0 0 0 0 k 18 3 0 0 0 0 0 0 0 0 0 0 0 0 l 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 m 18 17 0 0 0 0 0 0 0 0 0 0 0 0 0 0 n 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 o 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 p 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 q 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 16 4 r 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 s 0 0 29 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 19 6 0 0 t 0 0 21 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 u 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 5 0 0 5 0 0 v 0 16 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 w 21 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 27 21 0 0 4 0 0 x 0 0 26 0 0 11 0 0 0 0 26 26 0 26 0 25 0 26 10 0 0 0 0 0 25 10 8 y 0 0 0 0 0 16 14 0 0 3 9 9 0 9 15 9 0 9 7 0 0 29 4 12 7 8 4 2 Max SPPC=29 is at edge {27,34} Max SPPC=27 is at edge {15,33} {16,33} {19,33} {23,33} Max SPPC=25 is at edge {21,33} {30,33} Max SPPC=21 is at edge {21,33} {30,33} Max SPPC=19 is at edge {24,28} Max SPPC=16 is at edge {24,26} {9,34} G7 Max SPPC=14 is at edge {10,34}DNI (but del would remove only green) Max SPPC=12 is at edge {29,34} Max SPPC=11 is at edge {9,33} Max SPPC=10 is at edge {24,33} Max SPPC=9 is at edge {15,33} {16,33} {19,33} {21,33} {23,33} all DNI Max SPPC=8 is at edge {32,33} {31,34}DNI 1 2 3 4 5 6 7 8 9 10 a 11 b 12 c 13 d 14 e 15 f 16 g 17 h 18 i 19 j 20 k 21 l 22 m 23 n 24 o 25 p 26 q 27 r 28 s 29 t 30 u 31 v 32 w 33 x 34 y Max SPPC=7 is at edge {24,34} {30,34}DNI Max SPPC=6 is at edge {25,26}DNI Max SPPC=5 is at edge {24,30}DNI Max SPPC=4 is at edge {28,34} {29,32}DNI
DOSPPE: Measure between-ness using One Shortest Path per Edge. Delete edges with highest betweenness until a Connected Component peals off, recalc, del next highest, etc 1 0 1 1 1 1 1 1 1 1 0 1 1 1 1 0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 0 0 1 0 0 2 1 0 1 1 0 0 0 1 0 0 0 0 0 1 0 0 0 1 0 1 0 1 0 0 0 0 0 0 0 0 1 0 0 0 3 1 1 0 1 0 0 0 1 1 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 1 0 4 1 1 1 0 0 0 0 1 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 5 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 6 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7 1 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 9 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 1 8 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 e 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 i 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 2 3 4 5 6 7 8 9 10 a 11 b 12 c 13 d 14 e 15 f 16 g 17 h 18 i 19 j 20 k 21 l 22 m 23 n 24 o 25 p 26 q 27 r 28 s 29 t 30 u 31 v 32 w 33 x 34 y l 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 m 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 a 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 b 1 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 c 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 d 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 f 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 g 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 h 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 j 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 k 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 n 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 o 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 0 1 1 p 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 1 0 0 q 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 0 0 r 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 s 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 t 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 u 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 1 1 v 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 w 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 0 0 0 1 1 x 0 0 1 0 0 0 0 0 1 0 0 0 0 0 1 1 0 0 1 0 1 0 1 1 0 0 0 0 0 1 1 1 0 0 y 0 0 0 0 0 0 0 0 1 1 0 0 0 1 1 1 0 0 1 1 1 0 1 1 0 0 1 1 1 1 1 1 0 0 2 13 SPPCs 3 24 14 4 12 6 7 5 31 0 0 0 6 31 0 0 0 0 7 31 0 0 0 3 2 8 17 9 15 2 0 0 0 9 16 0 9 0 0 0 0 0 a 0 0 21 0 0 0 0 0 0 b 31 0 0 0 2 3 0 0 0 0 c 34 0 0 0 0 0 0 0 0 0 0 d 33 0 0 2 0 0 0 0 0 0 0 0 e 16 5 15 10 0 0 0 0 0 0 0 0 0 f 0 0 0 0 0 0 0 0 0 0 0 0 0 0 g 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 h 0 0 0 0 0 32 3 0 0 0 0 0 0 0 0 0 i 31 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 j 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 k 18 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 l 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 m 18 17 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 n 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 o 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 p 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 q 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 16 4 r 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 s 0 0 29 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 19 6 0 0 t 0 0 21 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 u 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 5 0 0 5 0 0 v 0 16 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 w 21 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 27 21 0 0 4 0 0 x 0 0 26 0 0 0 0 0 11 0 0 0 0 0 26 26 0 0 26 0 25 0 26 10 0 0 0 0 0 25 10 8 y 0 0 0 0 0 0 0 0 16 14 0 0 0 3 9 9 0 0 9 15 9 0 9 7 0 0 29 4 12 7 8 4 2 1 2 3 4 5 6 7 8 9 a b c d e f g h i j k l m n o p q r s t u v w x SPPC after deleting 5 6 7 11 17 10 12 13 14 15 16 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 1 2 3 4 8 9 a c d e f g i j k l m n o p q r s t u v w x 1 2 13 3 24 14 4 12 6 7 8 17 9 15 2 9 16 0 9 0 0 a 0 0 21 0 0 0 c 34 0 0 0 0 0 0 d 31 0 0 2 0 0 0 0 e 16 5 15 10 0 0 0 0 0 f 0 0 0 0 0 0 0 0 0 0 g 0 0 0 0 0 0 0 0 0 0 0 i 31 3 0 0 0 0 0 0 0 0 0 0 j 0 0 0 0 0 0 0 0 0 0 0 0 0 k 18 3 0 0 0 0 0 0 0 0 0 0 0 0 l 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 m 18 17 0 0 0 0 0 0 0 0 0 0 0 0 0 0 n 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 o 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 p 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 q 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 16 4 r 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 s 0 0 29 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 19 6 0 0 t 0 0 21 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 u 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 5 0 0 5 0 0 v 0 16 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 w 21 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 27 21 0 0 4 0 0 x 0 0 26 0 0 11 0 0 0 0 26 26 0 26 0 25 0 26 10 0 0 0 0 0 25 10 8 y 0 0 0 0 0 16 14 0 0 3 9 9 0 9 15 9 0 9 7 0 0 29 4 12 7 8 4 2 G7 Max SPPC=34 is at edge {1,12}DNI Next Max SPPC=33 is at edge {1,13} Next Max SPPC=32 is at edge {6,17} 1 2 3 4 5 6 7 8 9 10 a 11 b 12 c 13 d 14 e 15 f 16 g 17 h 18 i 19 j 20 k 21 l 22 m 23 n 24 o 25 p 26 q 27 r 28 s 29 t 30 u 31 v 32 w 33 x 34 y Next Max SPPC=31 is at edges {1,5} {5,6,7,11,17}=CC. Delete. Recalc. Start over Next Max SPPC=13 is at edges {1,2} {1,4} {29,34} Max SPPC=34 is at edge {1,12}DNI Next Max SPPC=31 is edges {1,18} {1,13}DNI Next Max SPPC=11 is at edges {9,33} Next Max SPPC=29 is edges {3,29} {27,34} Next Max SPPC=10 is at edges {4,14} {24,33} {31,33} Next Max SPPC=27 is at edge {25,32} Next Max SPPC=9 edges {2,8} {3,9} DNI{15,34} {16,34} {19,34} {23,34} Next Max SPPC=26 is at edges {3,33} {15,33} {16,33} {19,33} {23,33} Next Max SPPC=8 edges {31,34}DNI {32,33} Next Max SPPC=25 is at edges {21,33} {30,33} Next Max SPPC=7 edges {3,4}{30,34}DNI {24,34} Next Max SPPC=6 edges {25,28}DNI {2,14} Next Max SPPC=24 is at edges {1,3} {2,3} Next Max SPPC=21 is at edges {3,10} {1,32} {26,32} {24,28} {3,28} {1,2,3,4,8,12,13,18,20,22}=CC. Delete. Recalc. Start over Next Max SPPC=18 is at edges {1,20} {1,22} Next Max SPPC=17 is at edges {1,8} {2,22} Next Max SPPC=16 is at edges {1,9} {1,14} {24,26} {2,31} {9,34} Next Max SPPC=15 is at edges {3,8} {3,14} {10,34}DNI {20,34}
