An \(O(n\log n)\) algorithm for finding edge span of cacti (Q281767): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q186209
Created claim: DBLP publication ID (P1635): journals/jco/JanczewskiT16, #quickstatements; #temporary_batch_1731475607626
 
(3 intermediate revisions by 3 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.1007/s10878-015-9827-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2101461335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Geometry and Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(T\)-colorings and \(T\)-edge spans of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge span of distance two labellings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on labeling graphs with a condition at distance two / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jco/JanczewskiT16 / rank
 
Normal rank

Latest revision as of 06:30, 13 November 2024

scientific article
Language Label Description Also known as
English
An \(O(n\log n)\) algorithm for finding edge span of cacti
scientific article

    Statements

    Identifiers