Skip to main content
Stack Overflow
  1. About
  2. For Teams
Filter by
Sorted by
Tagged with
2 votes
1 answer
53 views

I’m running a private Proof-of-Authority (PoA) Ethereum fork using Geth with the Clique consensus algorithm and a custom chainId (1698369). My setup consists of four servers: Public RPC node behind ...
0 votes
0 answers
36 views

Why do signer account balances deplete to zero in a multi-node Clique EVM chain, but not in a single-node setup? I’m running a Clique-based EVM chain with the following setup: Two nodes, each with ...
0 votes
1 answer
179 views

I am stumbled at this part of SCC. I know that 5,6,7 is a strongly connected component. Performing the tarjan Algorithm for SCC starting at no de 5, I get unsatisfied values of low-link at 7. Graph ...
2 votes
1 answer
247 views

A r-uniform hypergraph is like a graph, but edges are defined as being sets of r nodes. I.e., a graph is a 2-uniform hypergraph. Say H is an r-uniform hypergraph on n vertices. A clique in H is a set ...
3 votes
2 answers
1k views

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
120 views

How to modify the Bron-Kerbosch algorithm to output a list of lists (or dict of lists) of cliques, based on a clique size? For example for the reference implementation from here - https://...
0 votes
0 answers
50 views

I cannot get what do I miss in my code, mostly right, but in graph that is large enough, WA appeared. graph is a dict which stores input and looks like: graph = { 4: {5, 6, 7, 8, 9}, 5: {4, 7, ...
1 vote
0 answers
59 views

A k-plex is a graph in which every vertex is adjacent to all but at most k vertices within the graph. Say I have a complete, undirected, weighted graph (a clique and also a k-plex), and I want to ...
1 vote
1 answer
192 views

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
2 answers
105 views

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 ...
0 votes
1 answer
193 views

here is my problem that I have been trying to solve for a week now. When I perform a swipe to the left to reveal my buttons, when the view locks at maxleft, the click is only triggered after the third ...
-1 votes
1 answer
158 views

When creating the click event in the shopping cart, it gives an error when inserting the function parameter: "onDelete(cartItem)" I don't understand why the problem. can you help me? Thanks! ...
1 vote
0 answers
69 views

I'm trying to calculate find_cliques functionality to locate the maximal cliques for each subgroup. I'm using this implementation using pandas_udf grouped by each connected component. def ...
2 votes
1 answer
473 views

I'm confused in graph cliques whether an edge could be considered as a clique or not as both are adjacent to each other like in attached photo, there is no clique of 3 or more edges. Example I ...
0 votes
1 answer
183 views

I'm creating a project in Fabricjs Canvas and I would like to know how to identify a click outside the canvas area, I want to deselect all objects with the canvas.discardActiveObject().renderAll() ...
Navi's user avatar
  • 19

15 30 50 per page
1
2 3 4 5
...
7

AltStyle によって変換されたページ (->オリジナル) /