Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
| 2018-09-17 21:04:43 +0200 | received badge | ● Notable Question (source) |
| 2017-07-22 00:40:41 +0200 | received badge | ● Popular Question (source) |
| 2017-07-21 17:28:21 +0200 | received badge | ● Student (source) |
| 2017-07-16 13:05:22 +0200 | asked a question | Way to solve max_split enumeration Hello everyone, I try to solve a problem on graphs. The graphs contain two types of nodes, a first type linked together containing max_cliques that I seek to determine. A second one connected only to the first. For the moment I enumerate the biggest cliques of the first type, then determines for each the number of nodes of the second type related to this one. Finally I list the one with the largest number of nodes of the second type. So I'm looking to find the biggest split graph. Do you have an idea to improve my current way? |
| 2015-09-17 19:43:23 +0200 | received badge | ● Famous Question (source) |
| 2015-08-03 22:49:43 +0200 | commented answer | Multiprocessing Maximal Cliques Enumeration In the paper their is only a Algorithmic process. Like you can see my English is not perfect, but I can test send a mail to the authors. Perhaps it will be a new implement to Sagemath! |
| 2015-08-03 18:53:28 +0200 | received badge | ● Notable Question (source) |
| 2015-08-03 14:32:37 +0200 | answered a question | Multiprocessing Maximal Cliques Enumeration Hy, I've test several options: Implement the pbitMCE algorithme : FAILED (I'm not enought skilled...) Subdivise the primary graph in as many ego_graph as nodes (without previous nodes to prevent duplicate cliques), and solve MCE for each one simultanatly ; WORKS but isn't a good parallel way (some subgraph have many cliques and some none, so firts calls use all cores and lasts use only two or one. As the second way : Subdivise the primary graph in as many ego_graph as nodes, test if they can contain a max_clique ; subdivise good one in as many ego_graph as nodes they contain, test if they can contain a max_clique ; subdivise each good one in as many ego_graph as nodes, test if they can contain a max_clique ; and finally solve MCE for each "good case"; WORKS in theory but i've issues... I think the node ordering is not the same each time i solve ego_graph, result : I've some duplicates cases and some accendently erased... so it's a FAIL... So I'm still looking for a good way to enumarate max clique on multiple cores... Someone is skilled enought for the first way? |
| 2015-08-03 14:11:54 +0200 | received badge | ● Popular Question (source) |
| 2015-07-16 12:46:57 +0200 | commented answer | Multiprocessing Maximal Cliques Enumeration I have multiple graphs, but often only one per time. I will take a look to implement pbitMCE. Thks |
| 2015-07-15 21:10:35 +0200 | commented answer | Multiprocessing Maximal Cliques Enumeration Thanks, sadly it's the first problem! I want solve some massive graphs (minimum 300 nodes, no maximum for the moment) For exemple, I see the pbitMCE algorithme, is it a way to implement it sage? http://www.cs.odu.edu/~ndasari/pBitMC... |
| 2015-07-15 16:12:02 +0200 | asked a question | Multiprocessing Maximal Cliques Enumeration Hy, Is it a multiproccesor way to obtain a Maximal Cliques Enumeration (MCE) ? I test maximal_cliques() (networkX and native) and maximum_cliques() but all of them use a one-cored algorythme too solve the Graph MCE. Is it implemented? or am I looking for a dream? |
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.