Matches in SemOpenAlex for { <https://semopenalex.org/work/W4322746371> ?p ?o ?g. }
Showing items 1 to 70 of
70
with 100 items per page.
- W4322746371 endingPage "340" @default.
- W4322746371 startingPage "328" @default.
- W4322746371 abstract "The P vs. NP problem is a major problem in computer science. It is perhaps the most celebrated outstanding problem in that domain. Its solution would have a tremendous impact on different fields such as mathematics, cryptography, algorithm research, artificial intelligence, game theory, multimedia processing, philosophy, economics and many other fields. It is still open since almost 50 years with attempts concentrated mainly in computational theory. However, as the problem is tightly coupled with np-complete class of problems theory, we think the best technique to tackle the problem is to find a polynomial time algorithm to solve one of the many np-completes problems. For that end this work represents attempts of solving the maximum independent set problem of any graph, which is a well known np-complete problem, in a polynomial time. The basic idea is to transform any graph into a perfect graph while the independence number or the maximum independent set of the graph is twice in size the maximum independent set or the 2nd largest maximal independent set of the transformed bipartite perfect graph. There are polynomial time algorithms for finding the independence number or the maximum independent set of perfect graphs. However, the difficulty is in finding the 2nd largest maximal independent set of the bipartite perfect transformed graph. Moreover, we characterise the transformed bipartite perfect graph and suggest algorithms to find the maximum independent set for special graphs. We think finding the 2nd largest maximal independent set of bipartite perfect graphs is feasible in polynomial time." @default.
- W4322746371 created "2023-03-03" @default.
- W4322746371 creator A5058869522 @default.
- W4322746371 creator A5068981769 @default.
- W4322746371 creator A5086285203 @default.
- W4322746371 date "2023-01-01" @default.
- W4322746371 modified "2023-09-29" @default.
- W4322746371 title "The P vs. NP Problem and Attempts to Settle It via Perfect Graphs State-of-the-Art Approach" @default.
- W4322746371 cites W1973199140 @default.
- W4322746371 cites W1993138363 @default.
- W4322746371 cites W2005938320 @default.
- W4322746371 cites W2047039514 @default.
- W4322746371 cites W2060270693 @default.
- W4322746371 cites W2069767473 @default.
- W4322746371 cites W2091469954 @default.
- W4322746371 cites W3038201368 @default.
- W4322746371 cites W3173850637 @default.
- W4322746371 cites W4251610435 @default.
- W4322746371 doi "https://doi.org/10.1007/978-3-031-28073-3_23" @default.
- W4322746371 hasPublicationYear "2023" @default.
- W4322746371 type Work @default.
- W4322746371 citedByCount "2" @default.
- W4322746371 countsByYear W43227463712022 @default.
- W4322746371 countsByYear W43227463712023 @default.
- W4322746371 crossrefType "book-chapter" @default.
- W4322746371 hasAuthorship W4322746371A5058869522 @default.
- W4322746371 hasAuthorship W4322746371A5068981769 @default.
- W4322746371 hasAuthorship W4322746371A5086285203 @default.
- W4322746371 hasConcept C114614502 @default.
- W4322746371 hasConcept C118615104 @default.
- W4322746371 hasConcept C122818955 @default.
- W4322746371 hasConcept C132525143 @default.
- W4322746371 hasConcept C18359143 @default.
- W4322746371 hasConcept C197657726 @default.
- W4322746371 hasConcept C203776342 @default.
- W4322746371 hasConcept C311688 @default.
- W4322746371 hasConcept C32972407 @default.
- W4322746371 hasConcept C33923547 @default.
- W4322746371 hasConcept C43517604 @default.
- W4322746371 hasConcept C8554925 @default.
- W4322746371 hasConceptScore W4322746371C114614502 @default.
- W4322746371 hasConceptScore W4322746371C118615104 @default.
- W4322746371 hasConceptScore W4322746371C122818955 @default.
- W4322746371 hasConceptScore W4322746371C132525143 @default.
- W4322746371 hasConceptScore W4322746371C18359143 @default.
- W4322746371 hasConceptScore W4322746371C197657726 @default.
- W4322746371 hasConceptScore W4322746371C203776342 @default.
- W4322746371 hasConceptScore W4322746371C311688 @default.
- W4322746371 hasConceptScore W4322746371C32972407 @default.
- W4322746371 hasConceptScore W4322746371C33923547 @default.
- W4322746371 hasConceptScore W4322746371C43517604 @default.
- W4322746371 hasConceptScore W4322746371C8554925 @default.
- W4322746371 hasLocation W43227463711 @default.
- W4322746371 hasOpenAccess W4322746371 @default.
- W4322746371 hasPrimaryLocation W43227463711 @default.
- W4322746371 hasRelatedWork W1608132493 @default.
- W4322746371 hasRelatedWork W1966320878 @default.
- W4322746371 hasRelatedWork W1977973532 @default.
- W4322746371 hasRelatedWork W2046755592 @default.
- W4322746371 hasRelatedWork W2066125721 @default.
- W4322746371 hasRelatedWork W3002604364 @default.
- W4322746371 hasRelatedWork W3119554879 @default.
- W4322746371 hasRelatedWork W3164327262 @default.
- W4322746371 hasRelatedWork W4297912977 @default.
- W4322746371 hasRelatedWork W4322746371 @default.
- W4322746371 isParatext "false" @default.
- W4322746371 isRetracted "false" @default.
- W4322746371 workType "book-chapter" @default.