Databases
StackOverflow2013
Postsdbo
POFinding a size of maximum subset of graph in which each vertex a degree atleast p
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POFinding a size of maximum subset of graph in which each vertex a degree atleast p
    primarykey
    data
    text
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. This table or related slice is empty.
    1. USShashwat Kumar
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POFinding a size of maximum subset of graph in which each vertex a degree atleast p
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POFinding a size of maximum subset of graph in which each vertex a degree atleast p
      1. This table or related slice is empty.
      1. VTUpMod
    1. COWhat have you tried? This is a nice problem (with an easy solution once you look at it the right way), but I'm struggling to find a hint for you that wouldn't immediately give it away :)
      singulars
      1. POFinding a size of maximum subset of graph in which each vertex a degree atleast p
      1. USus2012
    2. COIt seems to be some sort of clique type graph problem which is NP-Hard but may be due to query of size only, there is some way to solve it. Maximizing the size gives me some hint of using maximum matching algorithm but after spending time modelling it in matching, no success is still there.
      singulars
      1. POFinding a size of maximum subset of graph in which each vertex a degree atleast p
      1. USShashwat Kumar
    3. COHow about this: Look at your original graph. Which vertices can never be part of the subset you are looking for?
      singulars
      1. POFinding a size of maximum subset of graph in which each vertex a degree atleast p
      1. USus2012
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload