61 questions
- Bountied 0
- Unanswered
- Frequent
- Score
- Trending
- Week
- Month
- Unanswered (my tags)
3
votes
2
answers
1k
views
Finding subgraphs homeomorphic to k5 or k3,3
Given a simple graph, problem is to check if there is a subgraph homeomorphic to k5 or k3,3, and if there is, output which one is present(k5 or k3,3 or both). I need a reasonably fast algorithm that ...
1
vote
1
answer
192
views
Saving cliques in Boost's implementation of Bron Kerbosch algorithm
I tried using Boost's implementation of the Bron-Kerbosch algorithm to save the cliques in a graph. I am able to write it to a file but not save it within my code directly in a vector of list of nodes ...
2
votes
0
answers
287
views
Partitioning bipartite graphs into bicliques
Is there an efficient (say in O(|V|^2)) and preferably not overly complicated algorithm for dividing a bipartite graph into the smallest possible number of bicliques? The vertices can repeat, so that ...
3
votes
2
answers
290
views
Minimum clique cover problem: how to generate test cases?
How can I generate non trivial test cases for a minimum clique cover algorithm?
In other words, I'd like to generate a graph for which the minimum number of cliques and the assignment of each node to ...
2
votes
2
answers
105
views
How to remove vertices from a graph that are not coverable by cliques?
Given a graph G = (V, E), a set of vertices V* in V, and an integer k, how do we remove vertices from G such that the remaining vertices are either in V* or are in a clique of size k with at least one ...
1
vote
1
answer
47
views
How can I make this combination/clique algorithm more memory and time efficient, perhaps through multiprocessing?
Currently, I have a program that successfully converts a list of tuple pairs into triplets in which everything within the triplet is paired with each other. Here is the fully working Python program so ...
0
votes
1
answer
445
views
Is it NP-complete to find a sub-maximal clique which is at least max clique size - 1?
It is well-known that it is a NP-complete problem to find a maximal clique in a graph. But I wonder know if it possible to find a sub-maximal clique in a graph in polynomial time. That is, given that ...
1
vote
1
answer
72
views
Access to a number and a vector of an String in Prolog
I have to do the clique problem where the graph is defined like that:
[1-[2,3,4,5,6], 2-[1,3,4,5,6], 3-[1,2,4,5,6],4-[1,2,3,5,6], 5-[1,2,3,4,6], 6-[1,2,3,4,5]]
so I started to do this
c(_,[]).
c(G,X):-...
2
votes
0
answers
541
views
Polynomial time algorithm for finding clique of size Ω(logn)
I have a homework question asking for a polynomial algorithm to find a clique of size Ω(logn).
My current implementation is as follows:
Divide the graph into n^logn microsets (subgraphs) of size logn ...
0
votes
0
answers
616
views
Minimum possible Clique in a Graph
Find the minimum possible size of a clique in a graph, that can be formed using n nodes and e edges. The component should be a complete graph.
In other words,
Find min size of subset of vertices such ...
0
votes
1
answer
43
views
Problem interactions graphics when use drillthrough
I run into the following problem:
I have a report with several tabs, in one of the tabs there is a table called "Employees" with different filters that alter that table, and other graphics ...
0
votes
1
answer
1k
views
KeyError: 'source' for from_pandas_edge_list()
Here is my code:
import numpy as np
import pandas as pd
import networkx as nx
df = pd.read_excel(r"/path/to/file.xlsx", sheet_name="Sheet4")
df.edge=nx.from_pandas_edgelist(df,...
0
votes
1
answer
162
views
weka detailed accuracy by class
It the first time to deal with weka and ML. it's hard for me to read (detailed accuracy by class). Can anyone help me, please?
If you have any link or resources may help me.
1
vote
1
answer
939
views
What's the best algorithm for extracting all unique, complete subgraphs from an undirected graph of perhaps 1,024 nodes?
I ask this question with apologies for my obvious mathematical shortcomings as a practical programmer. It's been more than 40 years since I did well in high-school algebra and then failed at anything ...
2
votes
1
answer
572
views
Max Clique Optimization
I'm trying to find the max clique in a graph (adjacency matrix), the graph can have up to 50 nodes. Currently, what I have starts taking forever when the graph sizes get to around n=40. Can anyone ...