On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs (Q2268880): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.12.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049124187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Desirability of Acyclic Database Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of testing for odd holes and induced odd paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexities related to path properties on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting even holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs part I: Decomposition theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs part II: Recognition algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hypergraph acyclicity and graph chordality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Monophonic Convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of acyclicity for hypergraphs and relational database schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity in Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordless paths through three vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connections in acyclic hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical and monophonic convexities in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for query optimization in universal-relation databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141898 / rank
 
Normal rank

Latest revision as of 13:25, 2 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
scientific article

    Statements

    On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs (English)
    0 references
    0 references
    9 March 2010
    0 references
    chordless paths
    0 references
    bipartite graphs
    0 references
    interval operators
    0 references
    graph convexity
    0 references
    simple paths
    0 references
    even-chorded paths
    0 references

    Identifiers