FRINK Linked Data Fragments server

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

• W4302587030 endingPage "609" @default.
• W4302587030 startingPage "584" @default.
• W4302587030 abstract "Abstract We present a polynomial-space algorithm that computes the number of independent sets of any input graph in time $$O(1.1389^n)$$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo>(</mml:mo> <mml:mn>1</mml:mn> <mml:mo>.</mml:mo> <mml:msup> <mml:mn>1389</mml:mn> <mml:mi>n</mml:mi> </mml:msup> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> for graphs with maximum degree 3 and in time $$O(1.2356^n)$$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo>(</mml:mo> <mml:mn>1</mml:mn> <mml:mo>.</mml:mo> <mml:msup> <mml:mn>2356</mml:mn> <mml:mi>n</mml:mi> </mml:msup> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> for general graphs, where n is the number of vertices in the input graph. Together with the inclusion-exclusion approach of Björklund, Husfeldt, and Koivisto [SIAM J. Comput. 2009], this leads to a faster polynomial-space algorithm for the graph coloring problem with running time $$O(2.2356^n)$$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo>(</mml:mo> <mml:mn>2</mml:mn> <mml:mo>.</mml:mo> <mml:msup> <mml:mn>2356</mml:mn> <mml:mi>n</mml:mi> </mml:msup> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> as well as an exponential-space $$O(1.2330^n)$$ <mml:math xmlns:mml=http://www.w3.org/1998/Math/MathML> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo>(</mml:mo> <mml:mn>1</mml:mn> <mml:mo>.</mml:mo> <mml:msup> <mml:mn>2330</mml:mn> <mml:mi>n</mml:mi> </mml:msup> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> time algorithm for counting independent sets. Our main algorithm counts independent sets in graphs with maximum degree at most 3 and no vertex with three neighbors of degree 3. This polynomial-space algorithm is designed and analyzed using the recently introduced Separate, Measure and Conquer approach [Gaspers & Sorkin, ICALP 2015]. Using Wahlström’s compound measure approach, this improvement in running time for small degree graphs is then bootstrapped to larger degrees, giving the improvement for general graphs. Combining both approaches leads to some inflexibility in choosing vertices to branch on for the small-degree cases, which we counter by structural graph properties." @default.
• W4302587030 created "2022-10-06" @default.
• W4302587030 creator A5034693159 @default.
• W4302587030 creator A5048738368 @default.
• W4302587030 date "2022-10-11" @default.
• W4302587030 modified "2023-10-17" @default.
• W4302587030 title "Faster Graph Coloring in Polynomial Space" @default.
• W4302587030 cites W1439548790 @default.
• W4302587030 cites W1591820613 @default.
• W4302587030 cites W1964821516 @default.
• W4302587030 cites W1977514877 @default.
• W4302587030 cites W1982174487 @default.
• W4302587030 cites W1988642505 @default.
• W4302587030 cites W2002425091 @default.
• W4302587030 cites W2007200873 @default.
• W4302587030 cites W2015963099 @default.
• W4302587030 cites W2074359677 @default.
• W4302587030 cites W2089718638 @default.
• W4302587030 cites W2094731577 @default.
• W4302587030 cites W2122639972 @default.
• W4302587030 cites W2123864423 @default.
• W4302587030 cites W2124240997 @default.
• W4302587030 cites W2125058377 @default.
• W4302587030 cites W2133732980 @default.
• W4302587030 cites W2139364539 @default.
• W4302587030 cites W2154399201 @default.
• W4302587030 cites W2163938320 @default.
• W4302587030 cites W2168336253 @default.
• W4302587030 cites W2170702810 @default.
• W4302587030 cites W2244726603 @default.
• W4302587030 cites W2774159520 @default.
• W4302587030 cites W2895952552 @default.
• W4302587030 cites W2962886649 @default.
• W4302587030 doi "https://doi.org/10.1007/s00453-022-01034-7" @default.
• W4302587030 hasPublicationYear "2022" @default.
• W4302587030 type Work @default.
• W4302587030 citedByCount "0" @default.
• W4302587030 crossrefType "journal-article" @default.
• W4302587030 hasAuthorship W4302587030A5034693159 @default.
• W4302587030 hasAuthorship W4302587030A5048738368 @default.
• W4302587030 hasBestOaLocation W43025870301 @default.
• W4302587030 hasConcept C11413529 @default.
• W4302587030 hasConcept C41008148 @default.
• W4302587030 hasConceptScore W4302587030C11413529 @default.
• W4302587030 hasConceptScore W4302587030C41008148 @default.
• W4302587030 hasFunder F4320334704 @default.
• W4302587030 hasIssue "2" @default.
• W4302587030 hasLocation W43025870301 @default.
• W4302587030 hasLocation W43025870302 @default.
• W4302587030 hasOpenAccess W4302587030 @default.
• W4302587030 hasPrimaryLocation W43025870301 @default.
• W4302587030 hasRelatedWork W2051487156 @default.
• W4302587030 hasRelatedWork W2073681303 @default.
• W4302587030 hasRelatedWork W2317200988 @default.
• W4302587030 hasRelatedWork W2358668433 @default.
• W4302587030 hasRelatedWork W2376932109 @default.
• W4302587030 hasRelatedWork W2382290278 @default.
• W4302587030 hasRelatedWork W2386767533 @default.
• W4302587030 hasRelatedWork W2390279801 @default.
• W4302587030 hasRelatedWork W2748952813 @default.
• W4302587030 hasRelatedWork W2899084033 @default.
• W4302587030 hasVolume "85" @default.
• W4302587030 isParatext "false" @default.
• W4302587030 isRetracted "false" @default.
• W4302587030 workType "article" @default.