Intersection representations of matrices by subtrees and unicycles on graphs (Q935839): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jda.2007.08.001 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power of Natural Semijoins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal sub-triangulation in pre-processing phylogenetic data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar linear arrangements of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recognition algorithm for the intersection graphs of directed paths in directed trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recognition algorithm for the intersection graphs of paths in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating the maximum spanning trees of a weighted graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of Helly families of subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of concatenable subtrees of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simpler Linear-Time Recognition of Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic Hypergraph Projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm to recognize undirected path graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of Circle Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix characterizations of circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular representation problem on hypergraphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JDA.2007.08.001 / rank
 
Normal rank

Latest revision as of 08:51, 10 December 2024

scientific article
Language Label Description Also known as
English
Intersection representations of matrices by subtrees and unicycles on graphs
scientific article

    Statements

    Intersection representations of matrices by subtrees and unicycles on graphs (English)
    0 references
    0 references
    0 references
    0 references
    8 August 2008
    0 references
    intersection representation of a matrix
    0 references
    intersection graph
    0 references
    hypergraph
    0 references
    unicycle graph
    0 references
    biological network clustering
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references