Pages that link to "Item:Q2275910"
From MaRDI portal
The following pages link to Characterization of graphs and digraphs with small process numbers (Q2275910):
Displayed 5 items.
- On the monotonicity of process number (Q299059) (← links)
- Tradeoffs in process strategy games with application in the WDM reconfiguration problem (Q638539) (← links)
- Characterization of graphs and digraphs with small process numbers (Q2275910) (← links)
- A distributed algorithm for computing the node search number in trees (Q2429351) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)