Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
SLO
Login
Search
Browsing
Upload document
Statistics
RUP
FAMNIT - Faculty of Mathematics, Science and Information Technologies
FHŠ - Faculty of Humanities
FM - Faculty of Management
FTŠ Turistica - Turistica – College of Tourism Portorož
FVZ - Faculty of Health Sciences
IAM - Andrej Marušič Institute
PEF - Faculty of Education
UPR - University of Primorska
ZUP - University of Primorska Press
COBISS
University of Primorska, University Library - all departments
First page
/
Show document
Show document
A-
|
A+
|
Print
Title:
Maximum (weight) stable sets are sometimes easy to find
Authors:
ID
Milanič, Martin
(Author)
Files:
http://rutcor.rutgers.edu/fall2005/bb_121305.html
Language:
English
Work type:
Not categorized
Typology:
3.14 - Invited Lecture at Foreign University
Organization:
FAMNIT - Faculty of Mathematics, Science and Information Technologies
Year of publishing:
2005
PID:
20.500.12556/RUP-1162
UDC:
51
COBISS.SI-ID:
1024092756
Publication date in RUP:
15.10.2013
Views:
3192
Downloads:
44
Metadata:
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
MILANIČ, Martin, 2005, Maximum (weight) stable sets are sometimes easy to find. [online]. 2005. [Accessed 5 April 2025]. Retrieved from: http://rutcor.rutgers.edu/fall2005/bb_121305.html
Copy citation
Average score:
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
Share:
Similar works from our repository:
Fluid balance and hydration assessment during the weight-stable preparation phase in elite youth boxers
Strong cliques and stable sets
Avoidable vertices and edges in graphs
Generalizations of simplicial vertices and a new polynomially solvable case of the maximum weight clique problem, National Research University Higher School of Economics, Faculty of Computer Science, Moscow, 21. 8. 19
Priredba Zdravljice v lahko branje in brajico
Similar works from other repositories:
Maximum independent sets in direct products of cycles or trees with arbitrary graphs
It seems easy to float, but is it really?
Neutrosophic sets and systems
USING SOCIAL NETWORKS TO FIND JOB
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back