Matches in SemOpenAlex for { <https://semopenalex.org/work/W1577592701> ?p ?o ?g. }
Showing items 1 to 53 of
53
with 100 items per page.
- W1577592701 abstract "Graph colorability (COL) is a constraint satisfaction problem, which has been studied in the context of computational complexity and combinatorial search algorithms. It is also interesting as subjects of heuristics[2]. Many research reports discuss the complexity of COL [2,3,4,8,9,10]. Examples of possible candidates of order parameters that explain the mechanism making COLs very hard include the 3-paths[10], the minimal unsolvable subproblems[8], and the frozen developments[4]. Instead of generate-and-test approaches, we propose a constructive approach producing 3-colorablity problems (3COLs) that are exceptionally hard for usual backtracking algorithms adopting Brelaz heuristics and for Smallk coloring program[1]. Instances generated by our procedure (1) are 4-critical, (2) include no near-4-cliques(n4c's; 4-cliques with 1 edge removed) as subgraphs, and (3) have the degree of every node limited to 3 or 4: quasi-regular.This research was supported in part by the Ministry of Education, Culture, Sports, Science and Technology of Japan, Grant-in-Aid for Scientific Research (B)(2), No. 14380134, 2002-2005." @default.
- W1577592701 created "2016-06-24" @default.
- W1577592701 creator A5009954076 @default.
- W1577592701 creator A5048943133 @default.
- W1577592701 creator A5062933012 @default.
- W1577592701 date "2003-01-01" @default.
- W1577592701 modified "2023-10-04" @default.
- W1577592701 title "A Composition Algorithm for Very Hard Graph 3-Colorability Instances" @default.
- W1577592701 cites W1605282666 @default.
- W1577592701 cites W2002627038 @default.
- W1577592701 cites W2092520161 @default.
- W1577592701 cites W2161779091 @default.
- W1577592701 cites W2167036627 @default.
- W1577592701 doi "https://doi.org/10.1007/978-3-540-45193-8_78" @default.
- W1577592701 hasPublicationYear "2003" @default.
- W1577592701 type Work @default.
- W1577592701 sameAs 1577592701 @default.
- W1577592701 citedByCount "4" @default.
- W1577592701 crossrefType "book-chapter" @default.
- W1577592701 hasAuthorship W1577592701A5009954076 @default.
- W1577592701 hasAuthorship W1577592701A5048943133 @default.
- W1577592701 hasAuthorship W1577592701A5062933012 @default.
- W1577592701 hasConcept C11413529 @default.
- W1577592701 hasConcept C132525143 @default.
- W1577592701 hasConcept C138885662 @default.
- W1577592701 hasConcept C40231798 @default.
- W1577592701 hasConcept C41008148 @default.
- W1577592701 hasConcept C41895202 @default.
- W1577592701 hasConcept C80444323 @default.
- W1577592701 hasConceptScore W1577592701C11413529 @default.
- W1577592701 hasConceptScore W1577592701C132525143 @default.
- W1577592701 hasConceptScore W1577592701C138885662 @default.
- W1577592701 hasConceptScore W1577592701C40231798 @default.
- W1577592701 hasConceptScore W1577592701C41008148 @default.
- W1577592701 hasConceptScore W1577592701C41895202 @default.
- W1577592701 hasConceptScore W1577592701C80444323 @default.
- W1577592701 hasLocation W15775927011 @default.
- W1577592701 hasOpenAccess W1577592701 @default.
- W1577592701 hasPrimaryLocation W15775927011 @default.
- W1577592701 hasRelatedWork W1495130832 @default.
- W1577592701 hasRelatedWork W2051487156 @default.
- W1577592701 hasRelatedWork W2073681303 @default.
- W1577592701 hasRelatedWork W2379517208 @default.
- W1577592701 hasRelatedWork W2386767533 @default.
- W1577592701 hasRelatedWork W2391817034 @default.
- W1577592701 hasRelatedWork W2748952813 @default.
- W1577592701 hasRelatedWork W2899084033 @default.
- W1577592701 hasRelatedWork W3037789293 @default.
- W1577592701 hasRelatedWork W4317655900 @default.
- W1577592701 isParatext "false" @default.
- W1577592701 isRetracted "false" @default.
- W1577592701 magId "1577592701" @default.
- W1577592701 workType "book-chapter" @default.