David Herskovics

156

Reputation

116 views

Registered User

Name	David Herskovics
Member for	11 months
Seen	May 1 at 21:17
Website
Location
Age

stats recent reputation favorites

2

Questions

5

votes

1

answer

95

views

When can we make a digraph acyclic by fliping groups of arcs?

graph-theory co.combinatorics directed-graph acyclic-orientations

mar 15 at 9:05 David Herskovics 156●5

2

votes

1

answer

108

views

Graph implemened into the plane with segments as edges and we search for matching with no edges intersecting

co.combinatorics geometry perfect-matchings combinatorial-geometry

jul 7 at 18:53 Joseph O'Rourke 43.1k●1●49●214

3

Answers

votes newest views recent

When can we make a digraph acyclic by fliping groups of arcs?

Minimum spanning subgraph with at least one incoming and one outgoing edge

complexity of finding optimal matchings of given fixed size

6

Votes

6

12

Tags

graph-theory× 3
directed-graph× 2
co.combinatorics× 2
subgraph
spanning-tree
perfect-matchings
linear-programming
graph-cut
geometry
computational-complexity

combinatorial-geometry
acyclic-orientations

5

Badges

● Self-Learner
● Teacher

● Scholar
● Supporter