Matches in SemOpenAlex for { <https://semopenalex.org/work/W1559538863> ?p ?o ?g. }
Showing items 1 to 86 of
86
with 100 items per page.
- W1559538863 endingPage "92" @default.
- W1559538863 startingPage "81" @default.
- W1559538863 abstract "The Maximum Cardinality Search algorithm visits the vertices of a graph in an order such that at any point, a vertex is visited that has the largest number of visited neighbours. An MCS-ordering of a graph is an ordering of the vertices that can be generated by the Maximum Cardinality Search algorithm. The visited degree of a vertex v in an MCS-ordering is the number of neighbours of v that are before v in the ordering. The MCSLB of an MCS-ordering ψ of G is the maximum visited degree over all vertices v in ψ. Lucena [10] showed that the treewidth of a graph G is at least the MCSLB of any MCS-ordering of G.In this paper, we analyse the maximum MCSLB over all possible MCS-orderings of given graphs G. We give upper and lower bounds for this number for planar graphs. Given a graph G, it is NP-complete to determine if G has an MCS-ordering with MCSLB at least k, for any fixed k≥ 7. Also, this problem does not have a polynomial time approximation algorithm with constant ratio, unless P=NP. Variants of the problem are also shown to be NP-complete.We also propose and experimentally analysed some heuristics for the problem. Several tiebreakers for the MCS algorithm are proposed and evaluated. We also give heuristics that give upper bounds on the maximum MCSLB that an MCS-ordering can obtain which appear to give results close to optimal on several graphs from real life applications." @default.
- W1559538863 created "2016-06-24" @default.
- W1559538863 creator A5032730524 @default.
- W1559538863 creator A5043443150 @default.
- W1559538863 date "2004-01-01" @default.
- W1559538863 modified "2023-10-16" @default.
- W1559538863 title "On the Maximum Cardinality Search Lower Bound for Treewidth" @default.
- W1559538863 cites W1506542774 @default.
- W1559538863 cites W1553796682 @default.
- W1559538863 cites W1991477862 @default.
- W1559538863 cites W1992752571 @default.
- W1559538863 cites W2059372025 @default.
- W1559538863 cites W2080959483 @default.
- W1559538863 cites W2094122556 @default.
- W1559538863 cites W2111930185 @default.
- W1559538863 cites W2155920587 @default.
- W1559538863 doi "https://doi.org/10.1007/978-3-540-30559-0_7" @default.
- W1559538863 hasPublicationYear "2004" @default.
- W1559538863 type Work @default.
- W1559538863 sameAs 1559538863 @default.
- W1559538863 citedByCount "8" @default.
- W1559538863 crossrefType "book-chapter" @default.
- W1559538863 hasAuthorship W1559538863A5032730524 @default.
- W1559538863 hasAuthorship W1559538863A5043443150 @default.
- W1559538863 hasBestOaLocation W15595388632 @default.
- W1559538863 hasConcept C101837359 @default.
- W1559538863 hasConcept C114614502 @default.
- W1559538863 hasConcept C118615104 @default.
- W1559538863 hasConcept C121332964 @default.
- W1559538863 hasConcept C124101348 @default.
- W1559538863 hasConcept C126255220 @default.
- W1559538863 hasConcept C127705205 @default.
- W1559538863 hasConcept C132525143 @default.
- W1559538863 hasConcept C132569581 @default.
- W1559538863 hasConcept C134306372 @default.
- W1559538863 hasConcept C203776342 @default.
- W1559538863 hasConcept C24890656 @default.
- W1559538863 hasConcept C2775997480 @default.
- W1559538863 hasConcept C311688 @default.
- W1559538863 hasConcept C33923547 @default.
- W1559538863 hasConcept C41008148 @default.
- W1559538863 hasConcept C43517604 @default.
- W1559538863 hasConcept C77553402 @default.
- W1559538863 hasConcept C80899671 @default.
- W1559538863 hasConcept C87117476 @default.
- W1559538863 hasConceptScore W1559538863C101837359 @default.
- W1559538863 hasConceptScore W1559538863C114614502 @default.
- W1559538863 hasConceptScore W1559538863C118615104 @default.
- W1559538863 hasConceptScore W1559538863C121332964 @default.
- W1559538863 hasConceptScore W1559538863C124101348 @default.
- W1559538863 hasConceptScore W1559538863C126255220 @default.
- W1559538863 hasConceptScore W1559538863C127705205 @default.
- W1559538863 hasConceptScore W1559538863C132525143 @default.
- W1559538863 hasConceptScore W1559538863C132569581 @default.
- W1559538863 hasConceptScore W1559538863C134306372 @default.
- W1559538863 hasConceptScore W1559538863C203776342 @default.
- W1559538863 hasConceptScore W1559538863C24890656 @default.
- W1559538863 hasConceptScore W1559538863C2775997480 @default.
- W1559538863 hasConceptScore W1559538863C311688 @default.
- W1559538863 hasConceptScore W1559538863C33923547 @default.
- W1559538863 hasConceptScore W1559538863C41008148 @default.
- W1559538863 hasConceptScore W1559538863C43517604 @default.
- W1559538863 hasConceptScore W1559538863C77553402 @default.
- W1559538863 hasConceptScore W1559538863C80899671 @default.
- W1559538863 hasConceptScore W1559538863C87117476 @default.
- W1559538863 hasLocation W15595388631 @default.
- W1559538863 hasLocation W15595388632 @default.
- W1559538863 hasLocation W15595388633 @default.
- W1559538863 hasOpenAccess W1559538863 @default.
- W1559538863 hasPrimaryLocation W15595388631 @default.
- W1559538863 hasRelatedWork W1484856186 @default.
- W1559538863 hasRelatedWork W1554245510 @default.
- W1559538863 hasRelatedWork W1871156538 @default.
- W1559538863 hasRelatedWork W1978588354 @default.
- W1559538863 hasRelatedWork W1980466385 @default.
- W1559538863 hasRelatedWork W2332440504 @default.
- W1559538863 hasRelatedWork W2497554862 @default.
- W1559538863 hasRelatedWork W2797680869 @default.
- W1559538863 hasRelatedWork W4281819861 @default.
- W1559538863 hasRelatedWork W4293002939 @default.
- W1559538863 isParatext "false" @default.
- W1559538863 isRetracted "false" @default.
- W1559538863 magId "1559538863" @default.
- W1559538863 workType "book-chapter" @default.