Back to Results
First PageMeta Content
Spanning tree / NP-complete problems / One-in-three 3SAT / Tree / Theoretical computer science / Mathematics / Computational complexity theory


1 EGRES Quick-Proof No[removed]Finding edge-disjoint subgraphs in graphs Attila Bern´ath? and Zolt´an Kir´aly
Add to Reading List

Document Date: 2010-04-12 06:05:14

Open Document

File Size: 183,46 KB

Share Result on Facebook

City

Budapest / New York / /

Company

3SAT / CNF / TRUE value / W. H. Freeman & Co. / /

Country

Hungary / United States / /

/

Facility

E¨otv¨os University / /

IndustryTerm

open problem portal / /

Organization

E¨otv¨os University / CNL / Department of Computer Science / Department of Operations Research / /

Person

T . As / Attila Bern / /

ProgrammingLanguage

E / /

ProvinceOrState

New York / /

URL

www.cs.elte.hu/egres/open / www.cs.elte.hu/egres / /

SocialTag