Graph orientations with set connectivity requirements (Q442326): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(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.1016/j.disc.2012.04.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978956606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for source location in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3085455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Set Connector Problem in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting edge-connectivity between vertex subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:45, 5 July 2024

scientific article
Language Label Description Also known as
English
Graph orientations with set connectivity requirements
scientific article

    Statements