A MEASURE FOR THE LEXICOGRAPHICALLY FIRST MAXIMAL INDEPENDENT SET PROBLEM AND ITS LIMITS (Q5249021): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A fast parallel algorithm for the maximal independent set problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Using maximal independent sets to solve problems in parallel / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A taxonomy of problems with fast parallel algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The lexicographically first maximal subgraph problems:P-completeness andNC algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel graph algorithms that are efficients on average / rank | |||
Normal rank | |||
Latest revision as of 01:16, 10 July 2024
scientific article; zbMATH DE number 6432024
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A MEASURE FOR THE LEXICOGRAPHICALLY FIRST MAXIMAL INDEPENDENT SET PROBLEM AND ITS LIMITS |
scientific article; zbMATH DE number 6432024 |
Statements
A MEASURE FOR THE LEXICOGRAPHICALLY FIRST MAXIMAL INDEPENDENT SET PROBLEM AND ITS LIMITS (English)
0 references
29 April 2015
0 references
analysis of algorithms
0 references
NC algorithms
0 references
P-completeness
0 references
lexicographically first maximal subgraph problems
0 references
threshold function of a random graph
0 references
