- Sprache
-
Englisch
- Identifier
-
1196621233
Thema
Partition; Graphic methods
Beteiligte Personen und Organisationen
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:54 MEZ
Objekttyp
- Monografie
Beteiligte
- Issac, Davis
- Karrenbauer, Andreas
Ähnliche Objekte (12)
Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks
The average distance in Sierpiński triangle graphs and some remarks on the Linear Tower of Hanoi
The Interval Constrained 3-Coloring Problem
Random Growth Processes on Graphs
End space theory for directed and undirected graphs
Matching techniques ride to rescue OLED displays
Blinking Molecule Tracking
A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks
Colourings of P5-free graphs
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling
On graph sparsity and structure : colourings and graph decompositions
Approximation the Interval Constrained Coloring Problem
Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks
The average distance in Sierpiński triangle graphs and some remarks on the Linear Tower of Hanoi
The Interval Constrained 3-Coloring Problem
Random Growth Processes on Graphs
End space theory for directed and undirected graphs
Matching techniques ride to rescue OLED displays
Blinking Molecule Tracking
A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks
Colourings of P5-free graphs
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling
On graph sparsity and structure : colourings and graph decompositions
Approximation the Interval Constrained Coloring Problem
Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks
The average distance in Sierpiński triangle graphs and some remarks on the Linear Tower of Hanoi
The Interval Constrained 3-Coloring Problem
Random Growth Processes on Graphs
End space theory for directed and undirected graphs
Matching techniques ride to rescue OLED displays
Blinking Molecule Tracking
A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks
Colourings of P5-free graphs
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling
On graph sparsity and structure : colourings and graph decompositions