FRINK Linked Data Fragments server

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

• W4252143234 endingPage "255" @default.
• W4252143234 startingPage "254" @default.
• W4252143234 abstract "Previous article Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic HypergraphsRobert E. Tarjan and Mihalis YannakakisRobert E. Tarjan and Mihalis Yannakakishttps://doi.org/10.1137/0214020PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAddendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. SIAM Journal on Computing, 14(1), pp. 254–255 Previous article FiguresRelatedReferencesCited ByDetails Learning Hyperedge Replacement Grammars for Graph GenerationIEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 41, No. 3 | 1 Mar 2019 Cross Ref Paired threshold graphsDiscrete Applied Mathematics, Vol. 250 | 1 Dec 2018 Cross Ref Detecting Highly Overlapping Community Structure by Model-based Maximal Clique Expansion2018 IEEE International Conference on Big Data (Big Data) | 1 Dec 2018 Cross Ref Strict chordal and strict split digraphsDiscrete Applied Mathematics, Vol. 216 | 1 Jan 2017 Cross Ref Growing Graphs from Hyperedge Replacement Graph GrammarsProceedings of the 25th ACM International on Conference on Information and Knowledge Management | 24 October 2016 Cross Ref Tree decompositions and social graphsInternet Mathematics, Vol. 12, No. 5 | 16 May 2016 Cross Ref Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland SubgraphsNathan Lindzey and Ross M. McConnellSIAM Journal on Discrete Mathematics, Vol. 30, No. 1 | 12 January 2016AbstractPDF (857 KB)A faster algorithm to recognize even-hole-free graphsJournal of Combinatorial Theory, Series B, Vol. 113 | 1 Jul 2015 Cross Ref Edge deletion problems: Branching facilitated by modular decompositionTheoretical Computer Science, Vol. 573 | 1 Mar 2015 Cross Ref A new augmentation based algorithm for extracting maximal chordal subgraphsJournal of Parallel and Distributed Computing, Vol. 76 | 1 Feb 2015 Cross Ref A New Class of Lineage Expressions over Probabilistic Databases Computable in P-TimeScalable Uncertainty Management | 1 Jan 2013 Cross Ref On Finding Tucker Submatrices and Lekkerkerker-Boland SubgraphsGraph-Theoretic Concepts in Computer Science | 1 Jan 2013 Cross Ref BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSESDiscrete Mathematics, Algorithms and Applications, Vol. 04, No. 01 | 13 April 2012 Cross Ref On $3$-Colorable $P_5$-Free GraphsFrédéric Maffray and Grégory MorelSIAM Journal on Discrete Mathematics, Vol. 26, No. 4 | 27 November 2012AbstractPDF (1151 KB)Certifying algorithmsComputer Science Review, Vol. 5, No. 2 | 1 May 2011 Cross Ref A Novel Branching Strategy for Parameterized Graph Modification ProblemsCombinatorial Optimization and Applications | 1 Jan 2010 Cross Ref Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphsDiscrete Applied Mathematics, Vol. 157, No. 15 | 1 Aug 2009 Cross Ref Polarity of chordal graphsDiscrete Applied Mathematics, Vol. 156, No. 13 | 1 Jul 2008 Cross Ref A Fixed-Parameter Tractable Approach for the Wavelength Assignment Problem in Transparent NetworksIEEE Communications Letters, Vol. 12, No. 7 | 1 Jul 2008 Cross Ref Two fixed-parameter algorithms for Vertex Covering by Paths on TreesInformation Processing Letters, Vol. 106, No. 2 | 1 Apr 2008 Cross Ref Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic EncodingsLogic for Programming, Artificial Intelligence, and Reasoning | 1 Jan 2008 Cross Ref A Fixed-Parameter Tractable Algorithm for the Wavelength Assignment in WDM Mesh Networks2008 IEEE International Conference on Communications | 1 Jan 2008 Cross Ref Advances in Register Allocation TechniquesThe Compiler Design Handbook | 7 December 2009 Cross Ref Certifying Algorithms for Recognizing Interval Graphs and Permutation GraphsDieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, and Jeremy P. SpinradSIAM Journal on Computing, Vol. 36, No. 2 | 17 February 2012AbstractPDF (253 KB)Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc GraphsGraph-Theoretic Concepts in Computer Science | 1 Jan 2006 Cross Ref On Split-Coloring ProblemsJournal of Combinatorial Optimization, Vol. 10, No. 3 | 1 Nov 2005 Cross Ref Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval BigraphsPavol Hell and Jing HuangSIAM Journal on Discrete Mathematics, Vol. 18, No. 3 | 1 August 2006AbstractPDF (199 KB)Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval GraphsHaim Kaplan, Ron Shamir, and Robert E. TarjanSIAM Journal on Computing, Vol. 28, No. 5 | 28 July 2006AbstractPDF (361 KB)Minimal elimination ordering inside a given chordal graphGraph-Theoretic Concepts in Computer Science | 17 June 2005 Cross Ref Fixed-parameter tractability of graph modification problems for hereditary propertiesInformation Processing Letters, Vol. 58, No. 4 | 1 May 1996 Cross Ref Parallel computation of perfect elimination schemes using partition techniques on triangulated graphsComputers & Mathematics with Applications, Vol. 29, No. 6 | 1 Mar 1995 Cross Ref An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graphTheoretical Computer Science, Vol. 134, No. 2 | 1 Nov 1994 Cross Ref An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph30th Annual Symposium on Foundations of Computer Science | 1 Jan 1989 Cross Ref Doubly Lexical Orderings of MatricesAnna LubiwSIAM Journal on Computing, Vol. 16, No. 5 | 31 July 2006AbstractPDF (3081 KB)Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mappingProceedings 35th Annual Symposium on Foundations of Computer Science Cross Ref Volume 14, Issue 1| 1985SIAM Journal on Computing1-255 History Submitted:29 May 1984Published online:13 July 2006 InformationCopyright © 1985 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0214020Article page range:pp. 254-255ISSN (print):0097-5397ISSN (online):1095-7111Publisher:Society for Industrial and Applied Mathematics" @default.
• W4252143234 created "2022-05-12" @default.
• W4252143234 creator A5043084405 @default.
• W4252143234 creator A5051027549 @default.
• W4252143234 date "1985-02-01" @default.
• W4252143234 modified "2023-10-17" @default.
• W4252143234 title "Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs" @default.
• W4252143234 doi "https://doi.org/10.1137/0214020" @default.
• W4252143234 hasPublicationYear "1985" @default.
• W4252143234 type Work @default.
• W4252143234 citedByCount "31" @default.
• W4252143234 countsByYear W42521432342012 @default.
• W4252143234 countsByYear W42521432342013 @default.
• W4252143234 countsByYear W42521432342015 @default.
• W4252143234 countsByYear W42521432342016 @default.
• W4252143234 countsByYear W42521432342017 @default.
• W4252143234 countsByYear W42521432342018 @default.
• W4252143234 countsByYear W42521432342019 @default.
• W4252143234 countsByYear W42521432342022 @default.
• W4252143234 crossrefType "journal-article" @default.
• W4252143234 hasAuthorship W4252143234A5043084405 @default.
• W4252143234 hasAuthorship W4252143234A5051027549 @default.
• W4252143234 hasConcept C111472728 @default.
• W4252143234 hasConcept C11413529 @default.
• W4252143234 hasConcept C114614502 @default.
• W4252143234 hasConcept C118615104 @default.
• W4252143234 hasConcept C132525143 @default.
• W4252143234 hasConcept C138885662 @default.
• W4252143234 hasConcept C160446614 @default.
• W4252143234 hasConcept C17744445 @default.
• W4252143234 hasConcept C199539241 @default.
• W4252143234 hasConcept C2778945725 @default.
• W4252143234 hasConcept C2780586882 @default.
• W4252143234 hasConcept C2781221856 @default.
• W4252143234 hasConcept C311688 @default.
• W4252143234 hasConcept C33923547 @default.
• W4252143234 hasConcept C41008148 @default.
• W4252143234 hasConcept C74197172 @default.
• W4252143234 hasConceptScore W4252143234C111472728 @default.
• W4252143234 hasConceptScore W4252143234C11413529 @default.
• W4252143234 hasConceptScore W4252143234C114614502 @default.
• W4252143234 hasConceptScore W4252143234C118615104 @default.
• W4252143234 hasConceptScore W4252143234C132525143 @default.
• W4252143234 hasConceptScore W4252143234C138885662 @default.
• W4252143234 hasConceptScore W4252143234C160446614 @default.
• W4252143234 hasConceptScore W4252143234C17744445 @default.
• W4252143234 hasConceptScore W4252143234C199539241 @default.
• W4252143234 hasConceptScore W4252143234C2778945725 @default.
• W4252143234 hasConceptScore W4252143234C2780586882 @default.
• W4252143234 hasConceptScore W4252143234C2781221856 @default.
• W4252143234 hasConceptScore W4252143234C311688 @default.
• W4252143234 hasConceptScore W4252143234C33923547 @default.
• W4252143234 hasConceptScore W4252143234C41008148 @default.
• W4252143234 hasConceptScore W4252143234C74197172 @default.
• W4252143234 hasIssue "1" @default.
• W4252143234 hasLocation W42521432341 @default.
• W4252143234 hasOpenAccess W4252143234 @default.
• W4252143234 hasPrimaryLocation W42521432341 @default.
• W4252143234 hasRelatedWork W1502166895 @default.
• W4252143234 hasRelatedWork W2021962931 @default.
• W4252143234 hasRelatedWork W2497554862 @default.
• W4252143234 hasRelatedWork W2579720493 @default.
• W4252143234 hasRelatedWork W2885645764 @default.
• W4252143234 hasRelatedWork W3179053635 @default.
• W4252143234 hasRelatedWork W3212733298 @default.
• W4252143234 hasRelatedWork W4221160330 @default.
• W4252143234 hasRelatedWork W4293002939 @default.
• W4252143234 hasRelatedWork W2937282125 @default.
• W4252143234 hasVolume "14" @default.
• W4252143234 isParatext "false" @default.
• W4252143234 isRetracted "false" @default.
• W4252143234 workType "article" @default.