We’re rewarding the question askers & reputations are being recalculated! Read more.

Profile Activity

Ilan Aizelman WS

Network profile

Reputation

173

173
172
171

Feb
May
Aug
Nov

Top tag

graphs

Next privilege

250 Rep.

View close votes

Badges

10

Newest

Popular Question

Next badge

0/1

Impact

0 posts edited

0 helpful flags

17 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

Questions (7)

Votes Activity Newest

1	Given Directed Graph G(V,E) with red/black vertices, v is good if there's a path from v to a black vertex
1	Reduction from Clique to something else
1	Given DAG G(V,E), and weight on the vertices, find the heaviest path that starts from s
0	Can a PDA guess more than once? L = {aⁿ bⁱ aⁿ \| i,n > 0 }
0	Show that for each even n, there exists a graph with n vertices, such that the 2-approx VC alg returns a VC which is exactly twice the Minimum-VC

View more →

Reputation (173)

This user has no recent positive reputation changes

View more →

Answers (2)

Votes Activity Newest

3	Can two minimum spanning trees for a same graph has different number edges?
-1	Find a MST such that it's mostly red (original graph's edges are colored red and blue)

Tags (14)

2 graphs × 3	0 np-complete
0 computability × 3	0 turing-machines
0 reductions × 2	0 rice-theorem
0 np-hard	0 semi-decidability
0 clique	0 approximation

View more →

Accounts (16)

	Mathematics	3,798 rep	11 silver badges24 bronze badges
	Stack Overflow	1,540 rep	12 silver badges28 bronze badges
	Computer Science	173 rep	10 bronze badges
	Database Administrators	137 rep	5 bronze badges
	Physics	119 rep	2 bronze badges

Badges (9)

Recent Class Name

Popular Question × 2	Student
Critic	Editor
Commentator	Supporter
Teacher	Autobiographer
Scholar

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast (17)

all time			by type			month
16	up		0	question		1
1	down		17	answer		1

Computer Science Stack Exchange works best with JavaScript enabled