Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions

Theoretical Computer Science - Netherlands
doi 10.1016/j.tcs.2008.07.020
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Linear Time Algorithms for Finding Articulation and Hinge Vertices of Circular Permutation Graphs

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2013English

Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-Free Graphs

SIAM Journal on Computing
MathematicsComputer Science
1999English

An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation1

International Journal of Computer Mathematics
Computational TheoryApplied MathematicsComputer Science ApplicationsMathematics
2009English

Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus

SIAM Journal on Discrete Mathematics
Mathematics
1996English

Reset Sequences for Monotonic Automata

SIAM Journal on Computing
MathematicsComputer Science
1990English

Erratum To: Algorithms for Enumeration of Single-Transition Serial Sequences

Numerical Analysis and Applications
Numerical Analysis
2011English

Low Time Complexity Algorithms for Path Computation in Cayley Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2004English

Estimation for Single-Index and Partially Linear Single-Index Nonstationary Time Series Models

SSRN Electronic Journal
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy