Pages that link to "Item:Q5710792"

The following pages link to Graph-Theoretic Concepts in Computer Science (Q5710792):

Displaying 18 items.

• A new LBFS-based algorithm for cocomparability graph recognition (Q344849) (← links)
• A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
• Practical and efficient circle graph recognition (Q472484) (← links)
• Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
• End-vertices of LBFS of (AT-free) bigraphs (Q528559) (← links)
• A general label search to investigate classical graph search algorithms (Q617648) (← links)
• A tie-break model for graph search (Q896657) (← links)
• Ramified rectilinear polygons: coordinatization by dendrons (Q908206) (← links)
• A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements (Q963386) (← links)
• On end-vertices of lexicographic breadth first searches (Q968161) (← links)
• Laminar structure of ptolemaic graphs with applications (Q1028126) (← links)
• Medians in median graphs and their cube complexes in linear time (Q2119403) (← links)
• Graph searches and their end vertices (Q2165035) (← links)
• A directional heuristics pulse algorithm for a two resources constrained shortest path problem with reinitialization (Q2691338) (← links)
• Simple vertex ordering characterizations for graph search (Q3439379) (← links)
• The lexicographic method for the threshold cover problem (Q5925705) (← links)
• Linear optimization over homogeneous matrix cones (Q6047504) (← links)
• Finding biclique partitions of co-chordal graphs (Q6162046) (← links)