[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math

Search:


View post   

>> No.12145750 [View]
File: 209 KB, 1000x576, __rumia_touhou_drawn_by_carbonara_hontyotyo__0116b40c2274badff5918093cf935c6d.png [View same] [iqdb] [saucenao] [google]
12145750

>>12145663
Lax is good tho.

>> No.11972356 [View]
File: 209 KB, 1000x576, __rumia_touhou_drawn_by_carbonara_hontyotyo__0116b40c2274badff5918093cf935c6d.png [View same] [iqdb] [saucenao] [google]
11972356

>>11970105
It's great, isn't it?

>> No.11916299 [DELETED]  [View]
File: 209 KB, 1000x576, __rumia_touhou_drawn_by_carbonara_hontyotyo__0116b40c2274badff5918093cf935c6d.png [View same] [iqdb] [saucenao] [google]
11916299

>>11915126
Shitty idea as follows:
If you manage to find [math]k[/math] non-adjacent vertices, you know by default that each of them belongs to its own maximal clique that's disjoint from the remainder. I have no idea how fast you can do that, tbqh.
From there, you can construct the clique around each of those vertices by adding in the vertices that aren't adjacent to the other cliques (which can take you this far or that far depending on luck), and progressively delete cliques once they reach the element cap, until you need to finish it off the old way.

>> No.11914171 [View]
File: 209 KB, 1000x576, __rumia_touhou_drawn_by_carbonara_hontyotyo__0116b40c2274badff5918093cf935c6d.png [View same] [iqdb] [saucenao] [google]
11914171

>symplectic capacities

Navigation
View posts[+24][+48][+96]