Matches in SemOpenAlex for { <https://semopenalex.org/work/W2797081366> ?p ?o ?g. }
Showing items 1 to 80 of
80
with 100 items per page.
- W2797081366 abstract "For an undirected graph G, we consider the following problems: given a fixed graph H, can we partition the vertices of G into two non-empty sets A and B such that neither the induced graph G[A] nor G[B] contain H (i) as a subgraph? (ii) as an induced subgraph? These problems are NP-complete and are expressible in monadic second order logic (MSOL). The MSOL formulation, together with Courcelle's theorem implies linear time solvability on graphs with bounded tree-width. This approach yields algorithms with running time f(|phi|, t) * n, where |phi| is the length of the MSOL formula, t is the tree-width of the graph and n is the number of vertices of the graph. The dependency of f(|phi|, t) on |phi| can be as bad as a tower of exponentials. In this paper, we present explicit combinatorial algorithms for these problems for graphs G whose tree-width is bounded. We obtain 2^{O(t^r)} * n time algorithms when H is any fixed graph of order r. In the special case when H = K_r, a complete graph on r vertices, we get an 2^{O(t+r log t)} * n time algorithm. The techniques can be extended to provide FPT algorithms to determine the smallest number q such that V can be partitioned into q parts such that none of the parts have H as a subgraph (induced subgraph)." @default.
- W2797081366 created "2018-04-24" @default.
- W2797081366 creator A5013096911 @default.
- W2797081366 creator A5015293101 @default.
- W2797081366 creator A5055647664 @default.
- W2797081366 date "2018-04-11" @default.
- W2797081366 modified "2023-09-27" @default.
- W2797081366 title "Bipartitioning Problems on Graphs with Bounded Tree-Width." @default.
- W2797081366 cites W143512583 @default.
- W2797081366 cites W182050876 @default.
- W2797081366 cites W2009827511 @default.
- W2797081366 cites W2028357390 @default.
- W2797081366 cites W2033436489 @default.
- W2797081366 cites W2033951727 @default.
- W2797081366 cites W2117950870 @default.
- W2797081366 cites W2542720522 @default.
- W2797081366 cites W2555985695 @default.
- W2797081366 cites W2798588639 @default.
- W2797081366 cites W2914414140 @default.
- W2797081366 hasPublicationYear "2018" @default.
- W2797081366 type Work @default.
- W2797081366 sameAs 2797081366 @default.
- W2797081366 citedByCount "0" @default.
- W2797081366 crossrefType "posted-content" @default.
- W2797081366 hasAuthorship W2797081366A5013096911 @default.
- W2797081366 hasAuthorship W2797081366A5015293101 @default.
- W2797081366 hasAuthorship W2797081366A5055647664 @default.
- W2797081366 hasConcept C114614502 @default.
- W2797081366 hasConcept C118615104 @default.
- W2797081366 hasConcept C132525143 @default.
- W2797081366 hasConcept C132569581 @default.
- W2797081366 hasConcept C134306372 @default.
- W2797081366 hasConcept C203776342 @default.
- W2797081366 hasConcept C2778012994 @default.
- W2797081366 hasConcept C311688 @default.
- W2797081366 hasConcept C33923547 @default.
- W2797081366 hasConcept C34388435 @default.
- W2797081366 hasConcept C42812 @default.
- W2797081366 hasConcept C43517604 @default.
- W2797081366 hasConcept C80899671 @default.
- W2797081366 hasConceptScore W2797081366C114614502 @default.
- W2797081366 hasConceptScore W2797081366C118615104 @default.
- W2797081366 hasConceptScore W2797081366C132525143 @default.
- W2797081366 hasConceptScore W2797081366C132569581 @default.
- W2797081366 hasConceptScore W2797081366C134306372 @default.
- W2797081366 hasConceptScore W2797081366C203776342 @default.
- W2797081366 hasConceptScore W2797081366C2778012994 @default.
- W2797081366 hasConceptScore W2797081366C311688 @default.
- W2797081366 hasConceptScore W2797081366C33923547 @default.
- W2797081366 hasConceptScore W2797081366C34388435 @default.
- W2797081366 hasConceptScore W2797081366C42812 @default.
- W2797081366 hasConceptScore W2797081366C43517604 @default.
- W2797081366 hasConceptScore W2797081366C80899671 @default.
- W2797081366 hasLocation W27970813661 @default.
- W2797081366 hasOpenAccess W2797081366 @default.
- W2797081366 hasPrimaryLocation W27970813661 @default.
- W2797081366 hasRelatedWork W2175113412 @default.
- W2797081366 hasRelatedWork W2472058011 @default.
- W2797081366 hasRelatedWork W2626461876 @default.
- W2797081366 hasRelatedWork W2736873987 @default.
- W2797081366 hasRelatedWork W2757845740 @default.
- W2797081366 hasRelatedWork W2759324182 @default.
- W2797081366 hasRelatedWork W2887949973 @default.
- W2797081366 hasRelatedWork W2951133359 @default.
- W2797081366 hasRelatedWork W2952837428 @default.
- W2797081366 hasRelatedWork W2964077273 @default.
- W2797081366 hasRelatedWork W2964082660 @default.
- W2797081366 hasRelatedWork W2964213279 @default.
- W2797081366 hasRelatedWork W2997917651 @default.
- W2797081366 hasRelatedWork W3011353009 @default.
- W2797081366 hasRelatedWork W3023108549 @default.
- W2797081366 hasRelatedWork W3023439304 @default.
- W2797081366 hasRelatedWork W3092295815 @default.
- W2797081366 hasRelatedWork W3126108959 @default.
- W2797081366 hasRelatedWork W3138200510 @default.
- W2797081366 hasRelatedWork W2438971016 @default.
- W2797081366 isParatext "false" @default.
- W2797081366 isRetracted "false" @default.
- W2797081366 magId "2797081366" @default.
- W2797081366 workType "article" @default.