3008 search results - page 344 / 602 » Independence in connected graphs |
186
click to vote
CASC
2007
Springer
16 years 1 months ago
2007
Springer
For graphs there exist highly elaborated drawing algorithms. We concentrate here in an analogous way on visualizing relations represented as Boolean matrices as, e.g., in RelView. ...
159
click to vote
WOLLIC
2007
Springer
16 years 27 days ago
2007
Springer
Hydra games were introduced by Kirby and Paris, for the formulation of a result which is independent from Peano arithmetic but depends on the transfinite structure of 0. Tree ordi...
168
click to vote
LICS
2006
IEEE
16 years 25 days ago
2006
IEEE
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
150
click to vote
SIGCSE
2000
ACM
15 years 11 months ago
2000
ACM
We describe a Web-based interactive system, called PILOT, for testing computer science concepts. The strengths of PILOT are its universal access and platform independence, its use...
186
click to vote
APN
2006
Springer
15 years 10 months ago
2006
Springer
A netchart is basically a Petri net whose places are located at some process and whose transitions are labeled by message sequence charts (MSCs). Two recent papers showed independe...