Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with graphs
Search options not deleted
user 145977
Questions about graphs, discrete structures of nodes which are connected by edges, including trees and graphs with weighted edges.
0
votes
0
answers
86
views
Search for complete bipartite subgraph of graph
What is the time complexity of the best-known algorithm to search for the largest complete bipartite subgraph (not induced subgraph, since not all edges have to be considered) in a given graph?
A comp …
- 59
3
votes
2
answers
262
views
Maximum planar subgraph problem
Given a graph G I want to find the maximum planar subgraph which is a grid graph.
(Because the nodes of this subgraph represent points on a grid).
Is there any library in python for finding the maximu …
- 59
0
votes
2
answers
247
views
Searching for the largest bipartite subgraph
OpenAI's Chat-GPT told me:
There is no known exact algorithm for finding the largest bipartite subgraph in a graph in polynomial time. This problem is generally believed to be NP-hard, which means tha …
- 59