A selected tour of the theory of identification matrices (Q1575436): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / 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: Efficient parallel recognition of some circular arc graphs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel recognition of some circular arc graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel recognition of the consecutive ones property with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3327728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: $O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the all-pairs-shortest-path problem in unweighted undirected graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound on the complexity of the all pairs shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix characterizations of circular-arc graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:12, 30 May 2024

scientific article
Language Label Description Also known as
English
A selected tour of the theory of identification matrices
scientific article

    Statements

    A selected tour of the theory of identification matrices (English)
    0 references
    0 references
    21 August 2000
    0 references
    0 references
    identification matrices
    0 references
    graph isomorphism
    0 references
    bipartite graphs
    0 references
    consecutive ones property
    0 references