Pages that link to "Item:Q3655133"
From MaRDI portal
The following pages link to Graph Theory, Computational Intelligence and Thought (Q3655133):
Displayed 21 items.
- Landmarks in Algorithmic Graph Theory: A Personal Retrospective (Q3655134) (← links)
- A Higher-Order Graph Calculus for Autonomic Computing (Q3655135) (← links)
- Algorithms on Subtree Filament Graphs (Q3655136) (← links)
- A Note on the Recognition of Nested Graphs (Q3655137) (← links)
- Asynchronous Congestion Games (Q3655138) (← links)
- Combinatorial Problems for Horn Clauses (Q3655139) (← links)
- Covering a Tree by a Forest (Q3655140) (← links)
- Dominating Induced Matchings (Q3655141) (← links)
- HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results (Q3655143) (← links)
- Local Search Heuristics for the Multidimensional Assignment Problem (Q3655144) (← links)
- On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
- On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph (Q3655146) (← links)
- On Path Partitions and Colourings in Digraphs (Q3655147) (← links)
- On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6 (Q3655148) (← links)
- On the Cubicity of AT-Free Graphs and Circular-Arc Graphs (Q3655149) (← links)
- O(m logn) Split Decomposition of Strongly Connected Graphs (Q3655150) (← links)
- Path-Bicolorable Graphs (Q3655151) (← links)
- Path Partitions, Cycle Covers and Integer Decomposition (Q3655152) (← links)
- Properly Coloured Cycles and Paths: Results and Open Problems (Q3655153) (← links)
- Recognition of Antimatroidal Point Sets (Q3655154) (← links)
- Tree Projections: Game Characterization and Computational Aspects (Q3655155) (← links)