FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W395829677> ?p ?o ?g. }

• W395829677 abstract "Many problems arising in graph theory are difficult by nature, and finding solutions to large or complex instances of them often require the use of computers. As some such problems are NP-hard or lie even higher in the polynomial hierarchy, it is unlikely that efficient, exact algorithms will solve them. Therefore, alternative computational methods are used. Combinatorial computing is a branch of mathematics and computer science concerned with these methods, where algorithms are developed to generate and search through combinatorial structures in order to determine certain properties of them. In this thesis, we explore a number of such techniques, in the hopes of solving specific problem instances of interest. Three separate problems are considered, each of which is attacked with different methods of combinatorial computing and optimization. The first, originally proposed by Erdős and Hajnal in 1967, asks to find the Folkman number Fe(3, 3; 4), defined as the smallest order of a K4-free graph that is not the union of two triangle-free graphs. A notoriously difficult problem associated with Ramsey theory, the best known bounds on it prior to this work were 19 ≤ Fe(3, 3; 4) ≤ 941. We improve the upper bound to Fe(3, 3; 4) ≤ 786 using a combination of known methods and the Goemans-Williamson semi-definite programming relaxation of MAX-CUT. The second problem of interest is the Ramsey number R(C4,Km), which is the smallest n such that any n-vertex graph contains a cycle of length four or an independent set of order m. With the help of combinatorial algorithms, we determine R(C4,K9) = 30 and R(C4,K10) = 36 using large-scale computations on the Open Science Grid. Finally, we explore applications of the well-known Lenstra-Lenstra-Lovasz (LLL) algorithm, a polynomial-time algorithm that, when given a basis of a lattice, returns a basis for the same lattice with relatively short vectors. The main result of this work is an application to graph domination, where certain hard instances are solved using this algorithm as a heuristic." @default.
• W395829677 created "2016-06-24" @default.
• W395829677 creator A5034088397 @default.
• W395829677 date "2013-01-01" @default.
• W395829677 modified "2023-09-26" @default.
• W395829677 title "Solving Hard Graph Problems with Combinatorial Computing and Optimization" @default.
• W395829677 cites W107492737 @default.
• W395829677 cites W111038805 @default.
• W395829677 cites W1444168583 @default.
• W395829677 cites W1485280854 @default.
• W395829677 cites W1485732691 @default.
• W395829677 cites W1493071618 @default.
• W395829677 cites W149470655 @default.
• W395829677 cites W1499314742 @default.
• W395829677 cites W1510730180 @default.
• W395829677 cites W1513230022 @default.
• W395829677 cites W1513310534 @default.
• W395829677 cites W1519405745 @default.
• W395829677 cites W1535858642 @default.
• W395829677 cites W1536407181 @default.
• W395829677 cites W1540529426 @default.
• W395829677 cites W1547867742 @default.
• W395829677 cites W1557027117 @default.
• W395829677 cites W1566493102 @default.
• W395829677 cites W1576694326 @default.
• W395829677 cites W1580714944 @default.
• W395829677 cites W1581552469 @default.
• W395829677 cites W1589219356 @default.
• W395829677 cites W1589700598 @default.
• W395829677 cites W1593970265 @default.
• W395829677 cites W1597196612 @default.
• W395829677 cites W1601503375 @default.
• W395829677 cites W1604945782 @default.
• W395829677 cites W1606480398 @default.
• W395829677 cites W1684642677 @default.
• W395829677 cites W181968519 @default.
• W395829677 cites W1963918951 @default.
• W395829677 cites W1965348767 @default.
• W395829677 cites W1968143987 @default.
• W395829677 cites W1971534380 @default.
• W395829677 cites W1971994465 @default.
• W395829677 cites W1977004736 @default.
• W395829677 cites W1979471257 @default.
• W395829677 cites W1984539579 @default.
• W395829677 cites W1985123706 @default.
• W395829677 cites W1999667176 @default.
• W395829677 cites W2000639038 @default.
• W395829677 cites W2004120849 @default.
• W395829677 cites W2004396921 @default.
• W395829677 cites W2008772536 @default.
• W395829677 cites W2009852526 @default.
• W395829677 cites W2010608390 @default.
• W395829677 cites W2011039300 @default.
• W395829677 cites W2014849651 @default.
• W395829677 cites W2016326717 @default.
• W395829677 cites W2016480989 @default.
• W395829677 cites W2018583476 @default.
• W395829677 cites W2019635364 @default.
• W395829677 cites W2029471744 @default.
• W395829677 cites W2032197527 @default.
• W395829677 cites W2033498477 @default.
• W395829677 cites W2036265926 @default.
• W395829677 cites W2038263937 @default.
• W395829677 cites W2040040623 @default.
• W395829677 cites W2044451186 @default.
• W395829677 cites W2046077540 @default.
• W395829677 cites W2048864944 @default.
• W395829677 cites W2048880136 @default.
• W395829677 cites W2051306216 @default.
• W395829677 cites W2051336598 @default.
• W395829677 cites W2051660589 @default.
• W395829677 cites W2052325621 @default.
• W395829677 cites W2056492141 @default.
• W395829677 cites W2057430998 @default.
• W395829677 cites W2057711397 @default.
• W395829677 cites W2060305124 @default.
• W395829677 cites W2067803318 @default.
• W395829677 cites W2068157715 @default.
• W395829677 cites W2068649659 @default.
• W395829677 cites W2068871408 @default.
• W395829677 cites W2073918695 @default.
• W395829677 cites W2088442094 @default.
• W395829677 cites W2089559635 @default.
• W395829677 cites W2091659991 @default.
• W395829677 cites W2095689360 @default.
• W395829677 cites W2100437838 @default.
• W395829677 cites W2110805362 @default.
• W395829677 cites W2114616381 @default.
• W395829677 cites W2115164934 @default.
• W395829677 cites W2137373403 @default.
• W395829677 cites W2138033161 @default.
• W395829677 cites W2141040012 @default.
• W395829677 cites W2143075842 @default.
• W395829677 cites W2150780437 @default.
• W395829677 cites W2155551829 @default.
• W395829677 cites W2156690988 @default.
• W395829677 cites W2166333600 @default.
• W395829677 cites W2169821423 @default.
• W395829677 cites W2219018056 @default.
• W395829677 cites W2222111777 @default.

• next