Graph connectivity, partial words, and a theorem of Fine and Wilf (Q924728): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Uniqueness Theorems for Periodic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fine and Wilf's theorem for three periods and a generalization of Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalised fine and Wilf's theorem for arbitrary number of periods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a paper by Castelli, Mignosi, Restivo / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fine and Wilf words for any periods / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On spaced seeds for similarity search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial words and a theorem of Fine and Wilf / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial words and a theorem of Fine and Wilf revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodicity on partial words / rank
 
Normal rank
Property / cites work
 
Property / cites work: FINE AND WILF'S THEOREM FOR PARTIAL WORDS WITH ARBITRARILY MANY WEAK PERIODS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial words and the interaction property of periods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sturmian words, Lyndon words and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sturmian words: structure, combinatorics, and their arithmetics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combinatorics of finite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some combinatorial properties of Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: A periodicity result of partial words with one hole / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic algorithm for vertex connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the connectivities of graphs and digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Determining Whether the Connectivity of a Graph is at Least<i>k</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Flow and Testing Graph Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Dynamic Algorithms for 2-Edge Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Vertex Connectivity: New Bounds from Old Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dividing a Graph into Triconnected Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for graph four-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank

Latest revision as of 09:16, 28 June 2024

scientific article
Language Label Description Also known as
English
Graph connectivity, partial words, and a theorem of Fine and Wilf
scientific article

    Statements

    Graph connectivity, partial words, and a theorem of Fine and Wilf (English)
    0 references
    0 references
    0 references
    19 May 2008
    0 references
    words
    0 references
    partial words
    0 references
    fine and wilf's theorem
    0 references
    periods
    0 references
    graph connectivity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers