Matches in SemOpenAlex for { <https://semopenalex.org/work/W1562726378> ?p ?o ?g. }
Showing items 1 to 62 of
62
with 100 items per page.
- W1562726378 endingPage "477" @default.
- W1562726378 startingPage "463" @default.
- W1562726378 abstract "We present a network flow based, degree of freedom analysis for graphs that arise in geometric constraint systems. For a vertex and edge weighted constraint graph with m edges and n vertices, we give an O(n(m + n)) time max-flow based algorithm to isolate a subgraph that can be solved separately. Such a subgraph is called dense. If the constraint problem is not overconstrained, the subgraph will be minimal.For certain overconstrained problems, finding minimal dense subgraphs may require up to O(n2 (m + n)) steps. Finding a minimum dense subgraph is NP-hard. The algorithm has been implemented and consistently outperforms a simple but fast, greedy algorithm." @default.
- W1562726378 created "2016-06-24" @default.
- W1562726378 creator A5043503435 @default.
- W1562726378 creator A5044457551 @default.
- W1562726378 creator A5089647969 @default.
- W1562726378 date "1997-01-01" @default.
- W1562726378 modified "2023-09-25" @default.
- W1562726378 title "Finding solvable subsets of constraint graphs" @default.
- W1562726378 cites W11372971 @default.
- W1562726378 cites W1968546622 @default.
- W1562726378 cites W1989367394 @default.
- W1562726378 cites W2008292658 @default.
- W1562726378 cites W2034654588 @default.
- W1562726378 cites W2040701667 @default.
- W1562726378 cites W2048825126 @default.
- W1562726378 cites W2060597653 @default.
- W1562726378 cites W2113898465 @default.
- W1562726378 cites W2125092299 @default.
- W1562726378 cites W2163228670 @default.
- W1562726378 cites W41699208 @default.
- W1562726378 cites W4244424643 @default.
- W1562726378 doi "https://doi.org/10.1007/bfb0017460" @default.
- W1562726378 hasPublicationYear "1997" @default.
- W1562726378 type Work @default.
- W1562726378 sameAs 1562726378 @default.
- W1562726378 citedByCount "22" @default.
- W1562726378 countsByYear W15627263782012 @default.
- W1562726378 countsByYear W15627263782015 @default.
- W1562726378 countsByYear W15627263782021 @default.
- W1562726378 crossrefType "book-chapter" @default.
- W1562726378 hasAuthorship W1562726378A5043503435 @default.
- W1562726378 hasAuthorship W1562726378A5044457551 @default.
- W1562726378 hasAuthorship W1562726378A5089647969 @default.
- W1562726378 hasConcept C114614502 @default.
- W1562726378 hasConcept C2524010 @default.
- W1562726378 hasConcept C2776036281 @default.
- W1562726378 hasConcept C33923547 @default.
- W1562726378 hasConcept C41008148 @default.
- W1562726378 hasConceptScore W1562726378C114614502 @default.
- W1562726378 hasConceptScore W1562726378C2524010 @default.
- W1562726378 hasConceptScore W1562726378C2776036281 @default.
- W1562726378 hasConceptScore W1562726378C33923547 @default.
- W1562726378 hasConceptScore W1562726378C41008148 @default.
- W1562726378 hasLocation W15627263781 @default.
- W1562726378 hasOpenAccess W1562726378 @default.
- W1562726378 hasPrimaryLocation W15627263781 @default.
- W1562726378 hasRelatedWork W1602072618 @default.
- W1562726378 hasRelatedWork W1978042415 @default.
- W1562726378 hasRelatedWork W2017331178 @default.
- W1562726378 hasRelatedWork W2098278475 @default.
- W1562726378 hasRelatedWork W2127881447 @default.
- W1562726378 hasRelatedWork W2496475388 @default.
- W1562726378 hasRelatedWork W2748952813 @default.
- W1562726378 hasRelatedWork W2899084033 @default.
- W1562726378 hasRelatedWork W2976797620 @default.
- W1562726378 hasRelatedWork W3086542228 @default.
- W1562726378 isParatext "false" @default.
- W1562726378 isRetracted "false" @default.
- W1562726378 magId "1562726378" @default.
- W1562726378 workType "book-chapter" @default.