Matches in SemOpenAlex for { <https://semopenalex.org/work/W2920431137> ?p ?o ?g. }
Showing items 1 to 65 of
65
with 100 items per page.
- W2920431137 abstract "This thesis deals mainly with the partitioning and connectedness of graphs. First, we show that the problem of partitioning the nodes of a graph into a specific number of subsets such that the induced subgraphs on these sets are isomorphic to one another is NP-complete. If the induced subgraphs have to be connected, the problem remains NP-complete. Then we inspect some special graph classes for which the problem is solvable in polynomial time.Afterwards, we deal with the problem of defining a polytope by incidence vectors of nodes, which induce a connected graph. We inspect some facet-defining inequalities and their general structure. For some graph classes we state the full description.We then proceed to the problem of partitioning the nodes of a graph into a given number of parts such that the induced graphs are connected. For the corresponding polytope we show the dimension and some facet defining inequalities. This theoretical inspection is advanced by the problem of partitioning a graph into different parts such that the parts induce a connected graph in order to maximize the induced cut. We introduce different ideas for solving this problem in SCIP and show the numerical results.This leads to interesting problems on MIPs in general. As the problem in literature generally deals with the feasible region, we focus on the objective function. To do that, we inspect the problem of finding MIPs for problems with nonlinear objective functions. We discuss properties and requirements showing the existence or non-existence of particular formulations.Lastly, we inspect the problem of partitioning the nodes of a graph such that all but one class are isomorphic. This problem becomes interesting if the part not inducing the isomorphism is minimized. For this purpose we also introduce a technique, which generates the parts by brute-force. Instead of partitioning the graph into isomorphic parts, we proceed to the problem of similar graphs. In this case we inspect different similarities and show algorithms which implement these." @default.
- W2920431137 created "2019-03-11" @default.
- W2920431137 creator A5081036492 @default.
- W2920431137 date "2019-02-08" @default.
- W2920431137 modified "2023-09-27" @default.
- W2920431137 title "Partitioning into Isomorphic or Connected Subgraphs" @default.
- W2920431137 hasPublicationYear "2019" @default.
- W2920431137 type Work @default.
- W2920431137 sameAs 2920431137 @default.
- W2920431137 citedByCount "0" @default.
- W2920431137 crossrefType "dissertation" @default.
- W2920431137 hasAuthorship W2920431137A5081036492 @default.
- W2920431137 hasConcept C114614502 @default.
- W2920431137 hasConcept C118615104 @default.
- W2920431137 hasConcept C132525143 @default.
- W2920431137 hasConcept C145691206 @default.
- W2920431137 hasConcept C15744967 @default.
- W2920431137 hasConcept C193435613 @default.
- W2920431137 hasConcept C201943243 @default.
- W2920431137 hasConcept C33923547 @default.
- W2920431137 hasConcept C41008148 @default.
- W2920431137 hasConcept C48903430 @default.
- W2920431137 hasConcept C542102704 @default.
- W2920431137 hasConcept C76444178 @default.
- W2920431137 hasConcept C80444323 @default.
- W2920431137 hasConceptScore W2920431137C114614502 @default.
- W2920431137 hasConceptScore W2920431137C118615104 @default.
- W2920431137 hasConceptScore W2920431137C132525143 @default.
- W2920431137 hasConceptScore W2920431137C145691206 @default.
- W2920431137 hasConceptScore W2920431137C15744967 @default.
- W2920431137 hasConceptScore W2920431137C193435613 @default.
- W2920431137 hasConceptScore W2920431137C201943243 @default.
- W2920431137 hasConceptScore W2920431137C33923547 @default.
- W2920431137 hasConceptScore W2920431137C41008148 @default.
- W2920431137 hasConceptScore W2920431137C48903430 @default.
- W2920431137 hasConceptScore W2920431137C542102704 @default.
- W2920431137 hasConceptScore W2920431137C76444178 @default.
- W2920431137 hasConceptScore W2920431137C80444323 @default.
- W2920431137 hasLocation W29204311371 @default.
- W2920431137 hasOpenAccess W2920431137 @default.
- W2920431137 hasPrimaryLocation W29204311371 @default.
- W2920431137 hasRelatedWork W1910274815 @default.
- W2920431137 hasRelatedWork W2024403359 @default.
- W2920431137 hasRelatedWork W2251566059 @default.
- W2920431137 hasRelatedWork W2289043657 @default.
- W2920431137 hasRelatedWork W2409462634 @default.
- W2920431137 hasRelatedWork W2474535028 @default.
- W2920431137 hasRelatedWork W2765499731 @default.
- W2920431137 hasRelatedWork W2767579966 @default.
- W2920431137 hasRelatedWork W2785873217 @default.
- W2920431137 hasRelatedWork W2950105543 @default.
- W2920431137 hasRelatedWork W2950774749 @default.
- W2920431137 hasRelatedWork W2950884682 @default.
- W2920431137 hasRelatedWork W3023181276 @default.
- W2920431137 hasRelatedWork W3102473470 @default.
- W2920431137 hasRelatedWork W3146698804 @default.
- W2920431137 hasRelatedWork W3166895563 @default.
- W2920431137 hasRelatedWork W3213120235 @default.
- W2920431137 hasRelatedWork W1591173501 @default.
- W2920431137 hasRelatedWork W2186149391 @default.
- W2920431137 hasRelatedWork W2247768113 @default.
- W2920431137 isParatext "false" @default.
- W2920431137 isRetracted "false" @default.
- W2920431137 magId "2920431137" @default.
- W2920431137 workType "dissertation" @default.